252 search results - page 26 / 51 » Decremental Clique Problem |
ALGORITHMICA
2006
14 years 9 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
109
click to vote
ICWN
2009
14 years 7 months ago
2009
The IEEE 802.11 Medium Access Control (MAC) protocol has inherent weakness of channel wastage while operating a Mobile Ad hoc Network (MANET). In this paper, we therefore propose s...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
WG
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...