5100 search results - page 600 / 1020 » The Linear Complexity of a Graph |
155
click to vote
PODC
2003
ACM
16 years 1 days ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
175
click to vote
BC
1998
15 years 6 months ago
1998
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
156
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
194
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
190
click to vote
QSHINE
2005
IEEE
16 years 11 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...