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
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 arsize data structure which processes queries in constant worstcase time and performs
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Adjacency Queries in Dynamic Sparse Grap..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.