1232 search results - page 2 / 247 » Digraphs: theory, algorithms and applications |
TCS
2008
13 years 5 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
JGAA
2006
13 years 5 months ago
2006
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
DAM
2007
13 years 5 months ago
2007
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...