Automata, Languages and Programming
From MaRDI portal
Publication:5716820
DOI10.1007/11523468zbMath1084.05503WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716820
C. Greg Plaxton, Nedialko B. Dimitrov
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Tight bounds for the cover time of multiple random walks, Using theorem proving to verify expectation and variance for discrete random variables