On the descriptive complexity of the two disjoint paths problem over undirected graphs

MaRDI QIDQ5460164zbMATH OpenFDO

Authors Haroldo G. Benatti, Ruy J. G. B. de Queiroz

Publication date 2 May 2008

zbMATH Keywords

Ehrenfeucht gamesinfinitary logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Other infinitary logic (03C75) Paths and cycles (05C38) Descriptive complexity and finite models (68Q19)

Recommendations

• STACS 2004
• Solving the 2-disjoint paths problem in nearly linear time
• A simple solution to the two paths problem in planar graphs
• The disjoint shortest paths problem
• scientific article; zbMATH DE number 727422

Cited in

(1)

• scientific article; zbMATH DE number 1409242 (Why is no real title available?)

This page was built for publication: On the descriptive complexity of the two disjoint paths problem over undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460164)