Join Our Newsletter

240 search results - page 1 / 48» The Tree Inclusion Problem: In Optimal Space and Faster |

ICALP

2005

Springer

12 years 5 months ago
2005

Springer

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...

CORR

2006

Springer

11 years 11 months ago
2006

Springer

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 ...

ESA

2008

Springer

12 years 1 months ago
2008

Springer

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...

SAC

2011

ACM

11 years 2 months ago
2011

ACM

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 ...

JOIN

2007

11 years 11 months ago
2007

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 ...