Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries

We study the following problem. Suppose G is a graph and TC G its transitive closure. If G′ is a new graph obtained from G by inserting or deleting an edge e, can the new transitive closure TC G′ , be defined in first-order logic using G, TC G and e? In this paper, we show that the answer is positiv...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation 1995-07, Vol.120 (1), p.101-106
Hauptverfasser:	Dong, G.Z., Su, J.W.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Information retrieval. Graph Logical, boolean and switching functions Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!