Sciweavers

Share
240 search results - page 1 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
ICALP
2005
Springer
12 years 5 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
CORR
2006
Springer
113views Education» more  CORR 2006»
11 years 11 months ago
The Tree Inclusion Problem: In Linear Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
Philip Bille, Inge Li Gørtz
ESA
2008
Springer
101views Algorithms» more  ESA 2008»
12 years 1 months ago
Faster Steiner Tree Computation in Polynomial-Space
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
SAC
2011
ACM
11 years 2 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
JOIN
2007
91views more  JOIN 2007»
11 years 11 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
books