Algorithms - ESA 2003
From MaRDI portal
Publication:5897248
DOI10.1007/b13632zbMath1266.05164OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897248
Fedor V. Fomin, Dimitrios M. Thilikos
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
treewidthdominating setbounded local treewidthminor-closed graph familydomination-treewidth property
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets, Adiabatic quantum programming: minor embedding with hard faults, A refined search tree technique for dominating set on planar graphs
