Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges

Peter Damaschke. Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. In Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, editors, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Volume 12126 of Lecture Notes in Computer Science, pages 224-236, Springer, 2020. [doi]

@inproceedings{Damaschke20a,
  title = {Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges},
  author = {Peter Damaschke},
  year = {2020},
  doi = {10.1007/978-3-030-48966-3_17},
  url = {https://doi.org/10.1007/978-3-030-48966-3_17},
  researchr = {https://researchr.org/publication/Damaschke20a},
  cites = {0},
  citedby = {0},
  pages = {224-236},
  booktitle = {Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings},
  editor = {Leszek Gasieniec and Ralf Klasing and Tomasz Radzik},
  volume = {12126},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-48966-3},
}