Search results for "Graph power"

showing 2 items of 12 documents

Searching for a strong double tracing in a graph

1998

Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.

Statistics and ProbabilityDiscrete mathematicsInformation Systems and ManagementVoltage graphDirected graphManagement Science and Operations ResearchButterfly graphlaw.inventionCombinatoricslawGraph powerModeling and SimulationLine graphString graphDiscrete Mathematics and CombinatoricsNull graphGraph factorizationMathematicsofComputing_DISCRETEMATHEMATICSMathematicsTop
researchProduct

Optimal Mass Transport on Metric Graphs

2015

We study an optimal mass transport problem between two equal masses on a metric graph where the cost is given by the distance in the graph. To solve this problem we find a Kantorovich potential as the limit of $p$-Laplacian--type problems in the graph where at the vertices we impose zero total flux boundary conditions. In addition, the approximation procedure allows us to find a transport density that encodes how much mass has to be transported through a given point in the graph, and also provides a simple formula of convex optimization for the total cost.

Voltage graphStrength of a graphDistance-regular graphTheoretical Computer Sciencelaw.inventionPlanar graphMetric k-centerCombinatoricssymbols.namesakelawGraph powerLine graphsymbolsCubic graphSoftwareMathematicsSIAM Journal on Optimization
researchProduct