Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs-Reference-Cited by-同舟云学术

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

Published: Issue: Volume: Page:582-593
ISSN:
Container-title:Algorithms – ESA 2007
language:
Short-container-title:

Author:

Gavoille Cyril,Labourel Arnaud

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75520-3_52.pdf

Reference25 articles.

1. Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling schemes for ancestor queries. SIAM J. on Computing 35, 1295 (2006)

2. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. on Discrete Mathematics 19, 448–462 (2005)

3. Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: FOCS. 43 rd Annual IEEE Symp. on Foundations of Computer Science, nov, pp. 53–62. IEEE Computer Society Press, Los Alamitos (2002)

4. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. on Algeb. and Disc. Meth. 8, 277–284 (1987)

5. Lecture Notes in Computer Science;F. Bazzaro,2005

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Space Complexity of Sum Labelling;Theory of Computing Systems;2023-08-25

2. Implicit Representation of Relations;Theory of Computing Systems;2023-08-15

3. The Implicit Graph Conjecture is False;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars;Lecture Notes in Computer Science;2022

5. The Space Complexity of Sum Labelling;Fundamentals of Computation Theory;2021