𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fully dynamic algorithm for the recognition of -sparse graphs

✍ Scribed by Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos

Book ID
113927741
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
525 KB
Volume
439
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fully dynamic algorithm for modular de
A fully dynamic algorithm for modular decomposition and recognition of cographs
✍ Ron Shamir; Roded Sharan πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 236 KB

The problem of dynamically recognizing a graph property calls for e ciently deciding if an input graph satisΓΏes the property under repeated modiΓΏcations to its set of vertices and edges. The input to the problem consists of a series of modiΓΏcations to be performed on the graph. The objective is to m

A recognition algorithm for the total gr
A recognition algorithm for the total graphs
✍ F. Gavril πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

## Abstract A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident. In this paper we present a

A Fully Dynamic Algorithm for Maintainin
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
✍ Valerie King; Garry Sagert πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 170 KB

This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph; hence, each reachability query of the form ''Is there a directed path from i