TREEWIDTH OF CIRCLE GRAPHS
From MaRDI portal
Publication:4886311
DOI10.1142/S0129054196000099zbMath0852.68069OpenAlexW2117657015WikidataQ56503308 ScholiaQ56503308MaRDI QIDQ4886311
Publication date: 26 November 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054196000099
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Treewidth for graphs with small chordality ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Fugitive-search games on graphs and related parameters ⋮ Triangulating multitolerance graphs ⋮ Pathwidth of Circular-Arc Graphs ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Parameterized domination in circle graphs ⋮ A revisit of the scheme for computing treewidth and minimum fill-in ⋮ A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs ⋮ On the Maximum Weight Minimal Separator ⋮ Unnamed Item
This page was built for publication: TREEWIDTH OF CIRCLE GRAPHS
