Sciweavers

316 search results - page 29 / 64
» On almost self-complementary graphs
Sort
View
JGT
2006
97views more  JGT 2006»
13 years 7 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus
SIAMCO
2000
74views more  SIAMCO 2000»
13 years 7 months ago
Nonsmooth Duality, Sandwich, and Squeeze Theorems
Given a nonlinear function h separating a convex and a concave function, we provide various conditions under which there exists an affine separating function whose graph is somewhe...
A. S. Lewis, R. E. Lucchetti
DM
2008
73views more  DM 2008»
13 years 7 months ago
Graphs with the n-e.c. adjacency property constructed from affine planes
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...
C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 1 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 1 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna