646 search results - page 31 / 130 » Generalized connected domination in graphs |
151
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
144
Voted
EJC
2006
15 years 5 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
150
Voted
VALUETOOLS
2006
ACM
15 years 11 months ago
2006
ACM
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
117
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
159
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...