275 search results - page 18 / 55 » Bounding the Number of Edges in Permutation Graphs |
147
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
135
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
174
click to vote
JDA
2006
15 years 6 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
168
click to vote
APPROX
2009
Springer
16 years 21 days ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
163
click to vote
GBRPR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...