The Parameterized Complexity of Some Minimum Label Problems

DOI10.1007/978-3-642-11409-0_8zbMath1273.68166DBLPconf/wg/FellowsGK09OpenAlexW1582649504WikidataQ57359755 ScholiaQ57359755MaRDI QIDQ5851096

Michael R. Fellows, Jiong Guo, Iyad A. Kanj

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Sequence Hypergraphs ⋮ Sequence Hypergraphs: Paths, Flows, and Cuts

This page was built for publication: The Parameterized Complexity of Some Minimum Label Problems