656 search results - page 55 / 132 » Graph Theoretical Characterization and Computation of Answer... |
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
MFCS
2009
Springer
14 years 6 days ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
WCNC
2010
IEEE
13 years 11 months ago
2010
IEEE
—This paper aims at answering the questions of how to enable cooperative communications in random access networks. And, since cooperation introduces extra transmissions in the ch...