Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
- 期刊名称Theoretical Computer Science
- 作者Le, Van Bang; Oversberg, Andrea; Schaudt, Oliver
- 卷第602卷
- 印刷ISSN0304-3975
- 文件大小406.52KB
- 发表时间2015-10
- DOI10.1016/j.tcs.2015.07.060
- 页码39-49
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012