2487 search results - page 89 / 498 » Partitions of Graphs into Trees |
IDEAS
2005
IEEE
14 years 3 months ago
2005
IEEE
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
ICPADS
2007
IEEE
14 years 3 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
ALGORITHMICA
2010
13 years 9 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
SSS
2009
Springer
14 years 4 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...