A dynamic implicit adjacency labelling scheme for line graphs

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 294-305

  Morgan, David ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR DETECTION; MATHEMATICAL MODELS;

ADJACENCY LABELING; LABELING SCHEME; LINE GRAPHS; STATIC ADJACENCY;

GRAPHIC METHODS;

EID: 26844510453     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_26     Document Type: Conference Paper

References (21)

1. Muller, J.H.: Local structure in graph classes. PhD thesis, Georgia Institute of Technology (1988)
2. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. on Discrete Mathematics 5 (1992) 596-603
3. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. J. of Distributed Computing 16 (2003) 111-120
4. th Int'l. Symp., LNCS 1893, Springer-Verlag (2000) 579-588
5. th Eur. Symp. on Algorithms, LNCS 2832. (2003) 254-265
6. th Int'l. Workshop, LNCS 1665, Springer-Verlag (1999) 30-41
7. th Int'l. Workshop, LNCS 2125, Springer-Verlag (2001) 246-257
8. th ACM-SIAM Symp. on Discrete Algorithms, ACM (2001) 547-556
9. th ACM Symp. on Parallel Algorithms and Architectures, ACM (2002) 258-264
10. th ACM Symp. on Parallel Algorithms and Architectures, ACM (2001) 1-10
11. th Int'l. Workshop, LNCS 1663, Springer-Verlag (1999) 342-351
12. th Int'l. Coll., LNCS 2719, Springer-Verlag (2003) 369-383
13. Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems 37 (2004) 49-75
14. st ACM Symp. on Principles of Database Systems. (2002) 271-281
15. Branstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)
16. Whitney, H.: Congruent graphs and the connectivity of graphs. American J. of Mathematics 54 (1932) 150-168
17. Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. of the ACM 21 (1974) 569-575
18. Roussopoulos, N.D.: A max{m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2 (1973) 108-112
19. Spinrad, J.: Efficient Graph Representation. Fields Institute Monographs. AMS, Providence (2003)
20. Morgan, D.: Useful names for vertices: An introduction to dynamic implicit informative labelling schemes. Technical Report TR05-04, Dept. of Computing Science, University of Alberta (2005)
21. Morgan, D.: A dynamic implicit adjacency labelling scheme for line graphs. Technical Report TR05-03, Dept. of Computing Science, University of Alberta (2005)