2304 search results - page 58 / 461 » On the Vulnerability of Large Graphs |
VISSOFT
2005
IEEE
15 years 5 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
KDD
2004
ACM
16 years 7 days ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
101
click to vote
ICALP
2009
Springer
16 years 3 days 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...
ENDM
2007
14 years 11 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
DSN
2007
IEEE
15 years 6 months ago
2007
IEEE
— Device scaling and large integration increase the vulnerability of microprocessors to transient errors. One of the structures where errors can be most harmful is the register ...