标题
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
作者
关键词
-
出版物
ACM Transactions on Algorithms
Volume 15, Issue 3, Pages 1-57
出版商
Association for Computing Machinery (ACM)
发表日期
2019-06-10
DOI
10.1145/3310228
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
- (2018) Fedor V. Fomin et al. ACM Transactions on Algorithms
- Clique-width III
- (2018) Fedor V. Fomin et al. ACM Transactions on Algorithms
- Applying clique-decomposition for computing Gromov hyperbolicity
- (2017) Nathann Cohen et al. THEORETICAL COMPUTER SCIENCE
- Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
- (2017) Archontia C. Giannopoulou et al. THEORETICAL COMPUTER SCIENCE
- A characterisation of clique-width through nested partitions
- (2015) Bruno Courcelle et al. DISCRETE APPLIED MATHEMATICS
- Computing the Gromov hyperbolicity of a discrete metric space
- (2015) Hervé Fournier et al. INFORMATION PROCESSING LETTERS
- Linear-Time Approximation for Maximum Weight Matching
- (2014) Ran Duan et al. JOURNAL OF THE ACM
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- (2014) Fedor V. Fomin et al. SIAM JOURNAL ON COMPUTING
- Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
- (2014) David Coudert et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Linear Time Split Decomposition Revisited
- (2012) Pierre Charbit et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Algorithmic Meta-theorems for Restrictions of Treewidth
- (2011) Michael Lampis ALGORITHMICA
- Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
- (2011) Emeric Gioan et al. DISCRETE APPLIED MATHEMATICS
- On the model-checking of monadic second-order formulas with edge set quantifications
- (2011) Bruno Courcelle DISCRETE APPLIED MATHEMATICS
- Boolean-width of graphs
- (2011) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- Intractability of Clique-Width Parameterizations
- (2010) Fedor V. Fomin et al. SIAM JOURNAL ON COMPUTING
- Clique-Width is NP-Complete
- (2009) Michael R. Fellows et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Solving some NP-complete problems using split decomposition
- (2008) Michaël Rao DISCRETE APPLIED MATHEMATICS
- Clique-width of graphs defined by one-vertex extensions
- (2008) Michaël Rao DISCRETE MATHEMATICS
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now