Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.05503OpenAlexW2940595899WikidataQ56656999 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Tight bounds for the cover time of multiple random walks ⋮ Using theorem proving to verify expectation and variance for discrete random variables

This page was built for publication: Automata, Languages and Programming