Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68363OpenAlexW4376561447MaRDI QIDQ5716998

Rolf Niedermeier, Jiong Guo, Michael Dom

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Closest 4-leaf power is fixed-parameter tractable

This page was built for publication: Computing and Combinatorics