2125 search results - page 20 / 425 » On Graph Complexity |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
LPAR
2004
Springer
14 years 26 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
ACSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
FSTTCS
1994
Springer
13 years 11 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...