1447 search results - page 174 / 290 » Graphs and Path Equilibria |
155
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
152
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
151
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 22 days ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
187
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
164
click to vote
NETWORKS
2002
15 years 4 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...