Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors

Algorithmica - United States
doi 10.1007/s00453-004-1125-y
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Exponential Random Graphs as Models of Overlay Networks

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2009English

On Exponential Domination of Graphs

English

Topological Minors in Graphs of Large Girth

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2002English

Crossing Numbers of Sierpiński-Like Graphs

Journal of Graph Theory
GeometryTopology
2005English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Crossing Numbers of Sequences of Graphs

English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Prime Coloring of Crossing Number Zero Graphs

Mathematical Journal of Interdisciplinary Sciences
2019English

Hitting Topological Minor Models in Planar Graphs Is Fixed Parameter Tractable

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy