Sciweavers

1395 search results - page 94 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
139
Voted
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
15 years 10 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
114
Voted
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 3 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov
108
Voted
IPL
2008
82views more  IPL 2008»
15 years 3 months ago
On fully orientability of 2-degenerate graphs
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
114
Voted
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
15 years 10 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
139
Voted
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
15 years 9 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...