Fast Minor Testing in Planar Graphs

Algorithmica - United States
doi 10.1007/s00453-011-9563-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Chasing a Fast Robber on Planar Graphs and Random Graphs

Journal of Graph Theory
GeometryTopology
2014English

Hitting Topological Minor Models in Planar Graphs Is Fixed Parameter Tractable

2020English

Projective-Planar Graphs With No K 3, 4 -Minor. II

Journal of Graph Theory
GeometryTopology
2016English

Well-Quasi-Ordering Infinite Graphs With Forbidden Finite Planar Minor

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1989English

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

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

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

2019English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Intuitionistic Fuzzy Planar Graphs

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Induced Matchings in Subcubic Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy