Optimal Fault-Tolerant Routings for ::::k::::-Connected Graphs with Smaller Routing Tables

Koichi Wada, Wei Chen. Optimal Fault-Tolerant Routings for ::::k::::-Connected Graphs with Smaller Routing Tables. In Ulrik Brandes, Dorothea Wagner, editors, Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings. Volume 1928 of Lecture Notes in Computer Science, pages 302-313, Springer, 2000. [doi]

@inproceedings{WadaC00,
  title = {Optimal Fault-Tolerant Routings for ::::k::::-Connected Graphs with Smaller Routing Tables},
  author = {Koichi Wada and Wei Chen},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1928/19280302.htm},
  tags = {graph-rewriting, rewriting, routing},
  researchr = {https://researchr.org/publication/WadaC00},
  cites = {0},
  citedby = {0},
  pages = {302-313},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
  editor = {Ulrik Brandes and Dorothea Wagner},
  volume = {1928},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41183-6},
}