A Faster FPT Algorithm for the Maximum Agreement Forest Problem
- 作者Michael Hallett; Catherine McCartin
- 卷第41卷
- 期第3期
- 印刷ISSN1432-4350
- 电子ISSN1433-0490
- 文件大小245.83KB
- 发表时间2007-10
- DOI10.1007/s00224-007-1329-z
- 页码539-550
On simultaneous planar graph embeddingsPeter Brass; Eowyn Cenek; Cristian A. Duncan; Alon Efrat; Cesim Erten; Dan P. Ismailescu; Stephen G. Kobourov; Anna Lubiw; Joseph S.B. Mitchell · 2007
Colored Simultaneous Geometric Embeddings andUlrik Brandes; Cesim Erten; Alejandro Estrella-Balderrama; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong; Michael Kaufmann; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; Antonios Symvonis · 2011
Editor's forewordArnold L. Rosenberg · Theory of Computing Systems · 1994
Universality of iterated networksR. F. Chamberlain; C. M. Fiduccia · Theory of Computing Systems · 1994
Primitives for asynchronous list compressionR. J. Anderson · Theory of Computing Systems · 1994
A lower bound for monotone perceptronsF. Green · Theory of Computing Systems · 1995
Guest editor's noteH. Raymond Strong · Theory of Computing Systems · 1993
The Failure Discovery problemVassos Hadzilacos; Joseph Y. Halpern · Theory of Computing Systems · 1993
Editor's forewordSandeep N. Bhatt · Theory of Computing Systems · 1994
An approach to emulating separable graphsBojana Obrenić · Theory of Computing Systems · 1994