9842 search results - page 1665 / 1969 » The Complexity of the Matching-Cut Problem |
169
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
122
click to vote
APSEC
2006
IEEE
15 years 10 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
154
click to vote
CODES
2006
IEEE
15 years 10 months ago
2006
IEEE
For modern embedded systems, the complexity of embedded applications has reached a point where the performance requirements of these applications can no longer be supported by emb...
139
click to vote
VISUALIZATION
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
139
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...