2487 search results - page 481 / 498 » Partitions of Graphs into Trees |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
OPODIS
2004
13 years 9 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
IJCAI
2003
13 years 9 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
CN
2006
13 years 8 months ago
2006
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...