Complexity of Cycle Transverse Matching Problems

DOI10.1007/978-3-642-25011-8_11zbMATH Open1314.68224OpenAlexW2103156667MaRDI QIDQ3111646

Ross Churchley, Xuding Zhu, Jing Huang

Publication date: 13 January 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_11

zbMATH Keywords

complexityalgorithmstable transversal problemtransverse matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Unnamed Item ⋮ Algorithmic complexity of finding cross-cycles in flag complexes

This page was built for publication: Complexity of Cycle Transverse Matching Problems

Report a bugQ3111646