1986 search results - page 7 / 398 » Path Separability of Graphs |
STOC
1990
ACM
13 years 11 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
FCT
2003
Springer
14 years 21 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
APVIS
2009
13 years 8 months ago
2009
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
MICS
2010
13 years 2 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...