PDF-Adjacency Queries in Dynamic Sparse Graphs Lukasz Kowalik Abstract We deal with the problem of maintaining a dynamic graph so tha t queries of the form is there an edge between and are processed fas

↓ Download
PDF-Adjacency Queries in Dynamic Sparse Graphs Lukasz Kowalik Abstract We deal with the problem of maintaining a dynamic graph so tha t queries of the form is there an edge between and are processed fas thumbnail
We consider graphs of bounded arboricity ie graphs with no dense subgraphs l ike for example planar graphs Brodal and Fagerberg WADS99 described a very simple line

Download Presentation

"Adjacency Queries in Dynamic Sparse Graphs Lukasz Kowalik Ab " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

Transcript not available.

Related Topics