Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Robert Endre Tarjan. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program., 77:169-177, 1997.

@article{Tarjan97,
  title = {Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm},
  author = {Robert Endre Tarjan},
  year = {1997},
  tags = {search},
  researchr = {https://researchr.org/publication/Tarjan97},
  cites = {0},
  citedby = {0},
  journal = {Math. Program.},
  volume = {77},
  pages = {169-177},
}

runs on WebDSL