260 search results - page 39 / 52 » Degree constrained subgraphs |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
SECON
2007
IEEE
14 years 2 months ago
2007
IEEE
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather tha...
SASN
2004
ACM
14 years 1 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...