A linear-time algorithm to find a separator in a graph excluding a minor
From MaRDI portal
Publication:2930265
DOI10.1145/1597036.1597043zbMath1298.05308OpenAlexW2030012922WikidataQ56235112 ScholiaQ56235112MaRDI QIDQ2930265
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1597036.1597043
No records found.
No records found.
Related Items (14)
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond ⋮ Subgraph densities in a surface ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Tree densities in sparse graph classes ⋮ Number of Cliques in Graphs with a Forbidden Subdivision ⋮ Cliques in graphs excluding a complete graph minor ⋮ On the number of cliques in graphs with a forbidden minor ⋮ The disjoint paths problem in quadratic time ⋮ Linkless and flat embeddings in 3-space ⋮ On the maximum number of cliques in a graph embedded in a surface ⋮ Approximating small balanced vertex separators in almost linear time ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Short and Simple Cycle Separators in Planar Graphs ⋮ Counting cliques in 1-planar graphs
This page was built for publication: A linear-time algorithm to find a separator in a graph excluding a minor
