Undirected Graphs of Entanglement 2

DOI10.1007/978-3-540-77050-3_42zbMath1135.68503arXiv0705.0419OpenAlexW3101550233MaRDI QIDQ5458861

Walid Belkhir, Luigi Santocanale

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0705.0419

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Entanglement and the complexity of directed graphs ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Parity games on undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Graph searching and a min-max theorem for tree-width
• Finding a central vertex in an HHD-free graph
• On the semi-perfect elimination
• Directed tree-width
• DAG-Width and Parity Games
• Mathematical Foundations of Computer Science 2005
• Logic for Programming, Artificial Intelligence, and Reasoning
• STACS 2005
• Rudiments of \(\mu\)-calculus

This page was built for publication: Undirected Graphs of Entanglement 2