Sciweavers

6740 search results - page 167 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICALP
2004
Springer
14 years 3 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
AAIM
2010
Springer
144views Algorithms» more  AAIM 2010»
14 years 2 months ago
Kernelization for Cycle Transversal Problems
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
Ge Xia, Yong Zhang
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 2 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
BIRTHDAY
2009
Springer
14 years 5 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
Gregory Gutin, Eun Jung Kim
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
14 years 4 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...