Sciweavers

2487 search results - page 263 / 498
» Partitions of Graphs into Trees
Sort
View
153
Voted
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 9 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
134
Voted
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 10 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
122
Voted
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 10 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
ICCS
2004
Springer
15 years 9 months ago
KNAML: A Knowledge Representation Language for Distributed Reasoning
The Knowledge Agent Mediation Language (KNAML) is designed for use in multi-agent reasoning systems. Like conceptual graphs, KNAML represents knowledge using concepts, relations, a...
Gordon Streeter, Andrew Potter
139
Voted
UAI
2004
15 years 5 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter