4 search results - page 1 / 1 » Improved Exact Exponential Algorithms for Vertex Bipartizati... |
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
JCB
2007
13 years 5 months ago
2007
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...