803 search results - page 50 / 161 » Independence in Direct-Product Graphs |
90
Voted
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
91
Voted
COMBINATORICS
2006
15 years 21 days ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
120
Voted
ENTCS
2002
15 years 11 days ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
110
click to vote
ANOR
2005
15 years 17 days ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
121
click to vote
PPL
2008
15 years 19 days ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...