1395 search results - page 19 / 279 » (k, )-Distance-Hereditary Graphs |
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
115
click to vote
ASUNAM
2011
IEEE
13 years 11 months ago
2011
IEEE
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
EJC
2006
14 years 11 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
100
click to vote
WALCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...