On the Complexity of Kings

From MaRDI portal

Revision as of 03:47, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5444973

Jump to:navigation, search

DOI10.1007/978-3-540-74240-1_29zbMath1135.68517OpenAlexW1998519935MaRDI QIDQ5444973

Till Tantau, Osamu Watanabe, Edith Hemaspaandra, Hemaspaandra, Lane A.

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the complexity of kings

This page was built for publication: On the Complexity of Kings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5444973&oldid=20215635"