Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Algorithmica - United States
doi 10.1007/s00453-009-9296-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Algorithms for Routing in Planar Graphs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1986English

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2011English

Flow-Cut Gaps and Face Covers in Planar Graphs

2019English

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

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Decompositions of Complete Multipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Tree Decompositions and Social Graphs

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2016English

Exact Gate Decompositions for Photonic Quantum Computing

Physical Review A
OpticsAtomicMolecular Physics,
2019English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy