3471 search results - page 58 / 695 » Obstacle Numbers of Graphs |
122
Voted
DM
2006
15 years 3 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
137
Voted
SIAMDM
2000
15 years 3 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...
175
Voted
IPL
2007
15 years 3 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
126
Voted
JGT
2010
15 years 2 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
123
Voted
ICCD
2002
IEEE
15 years 8 months ago
2002
IEEE
The exceedingly large size of fault dictionaries constitutes a fundamental obstacle to their usage. We outline a new method to reduce significantly the size of fault dictionaries...