Cargando…
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
Motivated by a warehouse logistics problem we study mappings of the vertices of a graph onto prescribed points on the real line that minimize the sum (or equivalently, the average) of the coordinates of the right ends of all edges. We focus on graphs whose edge numbers do not exceed the vertex numbe...
Autor principal: | Damaschke, Peter |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254886/ http://dx.doi.org/10.1007/978-3-030-48966-3_17 |
Ejemplares similares
-
MBG: Minimizer-based sparse de Bruijn Graph construction
por: Rautiainen, Mikko, et al.
Publicado: (2021) -
Strong sum distance in fuzzy graphs
por: Tom, Mini, et al.
Publicado: (2015) -
Sparse Zero-Sum Games as Stable Functional Feature Selection
por: Sokolovska, Nataliya, et al.
Publicado: (2015) -
On Proper Labellings of Graphs with Minimum Label Sum
por: Bensmail, Julien, et al.
Publicado: (2020) -
On the Adjacent Eccentric Distance Sum Index of Graphs
por: Qu, Hui, et al.
Publicado: (2015)