Improved Symmetric Lists

Improved Symmetric Lists (2004)

Cached

Download Links

by Christian Bachmaier , Marcus Raitner

Citations:

BibTeX

@TECHREPORT{Bachmaier04improvedsymmetric,
    author = {Christian Bachmaier and Marcus Raitner},
    title = {Improved Symmetric Lists},
    institution = {},
    year = {2004}
}

Bookmark

OpenURL

Abstract

We introduce a new data structure called symlist based on an idea of Tarjan [17]. A symlist is a doubly linked list without any directional information encoded into its cells. In a symlist the two pointers in each cell have no fixed meaning like previous or next in standard lists.

Citations

1813	The Art of Computer Programming - Knuth - 1968
422	Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams - Guibas, Stolfi - 1985
406	Testing for the consecutive ones properties, interval graphs and graph planarity using PQ-tree algorithm - Booth, Lueker - 1976
265	A data structure for dynamic trees - Sleator, Tarjan - 1983
85	STL Tutorial and Reference Guide - Musser, Derge, et al. - 2001
52	A Platform for Combinatorial and Geometric Computing - LEDA - 1996
23	Stop minding your P’s and Q’s: A simplified O(n) planar embedding algorithm - Boyer, Myrvold - 1999
19	Level planarity testing in linear time - Jünger, Leipert, et al. - 1998
8	Data Structures and Network Algorithms, Chapter 6 - Tarjan - 1983
4	Planarity Testing and Embedding in Linear Time. Dissertation, Mathematisch-Naturwissenschaftliche Fakultät der Universität zu - Level - 1998
3	Graph Template Library. http://www.infosun.fmi.uni-passau.de/GTL - GTL
2	PQ-Trees – An Implementation as Template Class in C - Leipert - 1997
1	Graph Algorithms, chapter 7–8 - Even - 1979
1	Data Structures and Algorithms in Java, chapter 5.2 - Goodrich, Tamassia - 2001
1	Recognizing level-planar dags in linear time - Heath, Pemmeraju - 1995