2612 search results - page 198 / 523 » Switching Graphs and Their Complexity |
163
click to vote
OPODIS
2001
15 years 5 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
140
click to vote
UAI
2003
15 years 5 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
158
click to vote
DBSEC
2008
15 years 5 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
146
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
138
click to vote
TVCG
2008
15 years 4 months ago
2008
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...