1729 search results - page 160 / 346 » Bound Graph Polysemy |
194
click to vote
ICC
2008
IEEE
16 years 26 days ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
172
click to vote
MFCS
2007
Springer
16 years 16 days ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
130
click to vote
SWAT
1990
Springer
15 years 10 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
171
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
165
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...