3396 search results - page 99 / 680 » Tree representations of graphs |
100
Voted
DISOPT
2006
15 years 23 days ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
105
click to vote
DAM
2007
15 years 21 days ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
120
click to vote
ANTSW
2004
Springer
15 years 6 months ago
2004
Springer
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
103
click to vote
SIAMDM
2010
14 years 7 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
99
Voted
DAM
2008
15 years 24 days ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...