Algorithms – ESA 2004
From MaRDI portal
Publication:5464620
DOI10.1007/b100428zbMath1111.68558OpenAlexW2483610301MaRDI QIDQ5464620
Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
The complexity of degree anonymization by graph contractions, Achievable sets, brambles, and sparse treewidth obstructions, Treewidth lower bounds with brambles, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, Tree decomposition and discrete optimization problems: a survey, Treewidth computations. II. Lower bounds, An Experimental Study of the Treewidth of Real-World Graph Data, Searching for a Visible, Lazy Fugitive
