Sciweavers

1395 search results - page 41 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ICALP
2011
Springer
12 years 12 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
WAIM
2010
Springer
13 years 6 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
DM
2011
253views Education» more  DM 2011»
13 years 3 months ago
On the hyperbolicity constant in graphs
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
José M. Rodríguez, Jose Maria Sigarr...
JCT
2006
100views more  JCT 2006»
13 years 8 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
IEEECIT
2009
IEEE
13 years 6 months ago
Hamiltonian Connectedness of Recursive Dual-Net
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
Yamin Li, Shietung Peng, Wanming Chu