Embedding longest fault-free paths in arrangement graphs with faulty vertices

Ray-Shang Lo, Gen-Huey Chen. Embedding longest fault-free paths in arrangement graphs with faulty vertices. Networks, 37(2):84-93, 2001. [doi]

@article{LoC01,
  title = {Embedding longest fault-free paths in arrangement graphs with faulty vertices},
  author = {Ray-Shang Lo and Gen-Huey Chen},
  year = {2001},
  doi = {10.1002/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-A},
  url = {http://dx.doi.org/10.1002/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-A},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LoC01},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {37},
  number = {2},
  pages = {84-93},
}