376 search results - page 65 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
TCS
2010
13 years 3 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
GD
2009
Springer
14 years 1 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...