5100 search results - page 380 / 1020 » The Linear Complexity of a Graph |
218
click to vote
DIALM
2005
ACM
15 years 9 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
210
click to vote
UAI
2003
15 years 8 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 ...
209
click to vote
DBSEC
2008
15 years 8 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....
219
click to vote
ICML
2010
IEEE
15 years 8 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 ...
190
Voted
TVCG
2008
15 years 7 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...