Flow-Cut Gaps and Face Covers in Planar Graphs

doi 10.1137/1.9781611975482.33
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems

2007English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Partitioning Planar Graphs: A Fast Combinatorial Approach for Max-Cut

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2009English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

A Face Cover Perspective to ℓ1 Embeddings of Planar Graphs

2020English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Reduced Graphs for Min-Cut/Max-Flow Approaches in Image Segmentation

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Intuitionistic Fuzzy Planar Graphs

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy