723 search results - page 15 / 145 » On the hyperbolicity constant in graphs |
WG
2001
Springer
13 years 12 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
WDAG
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
ARSCOM
2007
13 years 7 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...