Adjacency queries in dynamic sparse graphs

Information Processing Letters

Volumn 102, Issue 5, 2007, Pages 191-195

  Kowalik, Łukasz ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Adjacency; Data structures; Dynamic; Graph algorithms; Orientation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GLOSSARIES; QUERY PROCESSING;

ADJACENCY; GRAPH ALGORITHMS; ORIENTATION; SPARSE GRAPHS;

GRAPH THEORY;

EID: 33947543369     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.12.006     Document Type: Article

References (13)

1. A. Andersson, Faster deterministic sorting and searching in linear space, in: Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS'96), 1996, pp. 135-141
2. Andersson A., and Thorup M. Tight(er) worst-case bounds on dynamic searching and priority queues. Proc. of the 32nd Annual ACM Symposium on Theory of Computing (STOC'00) (2000), ACM Press 335-342
3. Beame P., and Fich F.F. Optimal bounds for the predecessor problem and related problems. J. Comput. System Sci. 65 (2002) 38-72
4. Brodal G.S., and Fagerberg R. Dynamic representations of sparse graphs. Proc. 6th Internat. Workshop on Algorithms and Data Structures (WADS'99). Lecture Notes in Comput. Sci. vol. 1663 (1999), Springer, Berlin 342-351
5. Chrobak M., and Eppstein D. Planar orientations with low out-degree and compaction of adjacency matrices. Theoret. Comput. Sci. 86 2 (1991) 243-266
6. Dietzfelbinger M., Karlin A., Mehlhorn K., and Meyer auf der Heide F. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23 4 (1994) 738-761
7. Fredman M.L., and Willard D.E. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47 (1993) 424-436
8. Kannan S., Naor M., and Rudich S. Implicit representation of graphs. Proc. of the 20th Annual ACM Symposium on Theory of Computing (STOC'88), New York, NY, USA (1988), ACM Press 334-343
9. Kowalik Ł. Fast 3-coloring triangle-free planar graphs. In: Albers S., and Radzik T. (Eds). Proc. 12th Annual European Symposium on Algorithms (ESA 2004). Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer-Verlag, Berlin 436-447
10. Kowalik Ł., and Kurowski M. Oracles for bounded length shortest paths in planar graphs. ACM Trans. Algorithms 2 3 (2006) 335-363
11. Mehlhorn K., Näher S., and Rauch M. On the complexity of a game related to the dictionary problem. SIAM J. Comput. 19 5 (1990) 902-906
12. Morgan D. A dynamic implicit adjacency labeling scheme for line graphs. Proc. 9th Int. Workshop on Algorithms and Data Structures (WADS'05). Lecture Notes in Comput. Sci. vol. 3608 (2005), Springer, Berlin 294-305
13. Nash-Williams C.S.J.A. Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964) 12