26 search results - page 5 / 6 » Parameterized Complexity of Finding Regular Induced Subgraph... |
203
Voted
ACID
2006
15 years 2 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
136
Voted
TPDS
2002
15 years 23 days ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
91
Voted
TCS
2008
15 years 1 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
111
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
139
Voted
MOBIHOC
2002
ACM
16 years 22 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...