Sparsest Cuts and Concurrent Flows in Product Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(03)00439-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Maximum Cuts in Edge-Colored Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Tight Cuts in Matching Covered Graphs

Journal of Combinatorics
2018English

Maximum Flows and Minimum Cuts in the Plane

Journal of Global Optimization
ControlOptimizationApplied MathematicsManagement ScienceComputer Science ApplicationsOperations Research
2009English

Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case

2012English

Protection of Lexicographic Product Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Partial Product of Graphs and Vizing's Conjecture

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2014English

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Embedding Complete Binary Trees in Product Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Product Rosy Labeling of Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy