1395 search results - page 115 / 279 » (k, )-Distance-Hereditary Graphs |
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
DM
2006
14 years 10 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
JCT
2008
14 years 10 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
VIZSEC
2005
Springer
15 years 3 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...