Reconstruction graphs and testing their properties in a relational spatial database

DOI10.1016/S0898-1221(02)00107-4zbMath1002.68047OpenAlexW2011500149MaRDI QIDQ1609074

Zsolt Tuza, Ágnes B. Novák

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(02)00107-4

zbMATH Keywords

Eulerian graphs2-connectivityPLA database

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient Planarity Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstruction graphs and testing their properties in a relational spatial database