1395 search results - page 96 / 279 » (k, )-Distance-Hereditary Graphs |
WG
2005
Springer
15 years 3 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
107
click to vote
NETWORKS
2002
14 years 9 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...