260 search results - page 27 / 52 » Degree constrained subgraphs |
97
Voted
JNW
2007
14 years 11 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
DM
2002
14 years 11 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
104
click to vote
CIDM
2009
IEEE
15 years 3 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
117
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...