Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...