149 search results - page 18 / 30 » The Longest Path Problem Is Polynomial on Interval Graphs |
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
ESA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
DAM
1999
13 years 7 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...