149 search results - page 14 / 30 » The Longest Path Problem Is Polynomial on Interval Graphs |
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
COMBINATORICA
2008
13 years 7 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
ATMOS
2010
13 years 6 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
DM
1998
13 years 7 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...