4074 search results - page 100 / 815 » Abstract Graph Transformation |
DAM
2008
14 years 10 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
CTRSA
2001
Springer
15 years 2 months ago
2001
Springer
a revised version of the extended abstract which appeared in The Cryptographers’ Track at RSA Conference ’2001 (8 – 12 april 2001, San Francisco, California, USA)
101
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
104
click to vote
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...