Imagen de Portada

A Bellman-Ford algorithm for the path-length-weighted distance in graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Arnau, R., Calabuig, J. M., Raffi, L. M. García, Pérez, E. A. Sánchez, Sanjuan, S.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Mathematical Software 05C38 (Primary) 90C35 (Secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Loop unrolling of UCA models: distance labeling
por: Soulignac, Francisco J, et al.
Publicado: (2022)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
por: Davari, Morteza, et al.
Publicado: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
por: Mühlenthaler, Moritz, et al.
Publicado: (2024)

Branching $k$-path vertex cover of forests
por: Makarov, Mikhail
Publicado: (2026)

Young domination on Hamming rectangles
por: Gravner, Janko, et al.
Publicado: (2025)

Solving the Graph Burning Problem for Large Graphs
por: Pereira, Felipe de Carvalho, et al.
Publicado: (2024)

Better and Simpler Reducibility Bounds over the Integers
por: Levin, Asaf
Publicado: (2025)

Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
por: Neuberger, John M., et al.
Publicado: (2024)

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
por: Vakhania, Nodari, et al.
Publicado: (2024)

4-cop-win graphs have at least 19 vertices
por: Turcotte, Jérémie, et al.
Publicado: (2020)

Moment generating functions in combinatorial optimization: Bipartite matching
por: Wästlund, Johan
Publicado: (2026)

Link Residual Closeness of Harary Graphs
por: Dangalchev, Ch.
Publicado: (2023)

A greedy heuristic for graph burning
por: García-Díaz, Jesús, et al.
Publicado: (2024)

Tree independence number V. Walls and claws
por: Chudnovsky, Maria, et al.
Publicado: (2025)

Cops and Robbers on Multi-Layer Graphs
por: Enright, Jessica, et al.
Publicado: (2023)

Implied Integrality in Mixed-Integer Optimization
por: van der Hulst, Rolf, et al.
Publicado: (2025)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
por: Dallard, Clément, et al.
Publicado: (2024)

A unified worst case for classical simplex and policy iteration pivot rules
por: Disser, Yann, et al.
Publicado: (2023)

Isolation critical graphs under multiple edge subdivision
por: Bartolo, Karl, et al.
Publicado: (2026)

A scalable clustering algorithm to approximate graph cuts
por: Suchan, Leo, et al.
Publicado: (2023)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
por: McFarland, Caleb
Publicado: (2026)

Pathographs and some (un)decidability results
por: Carter, Daniel, et al.
Publicado: (2025)

On the joint embedding property for cographs and trees
por: Carter, Daniel
Publicado: (2024)

An Algorithm to Recover Shredded Random Matrices
por: Atamanchuk, Caelan, et al.
Publicado: (2023)

Solution to a problem on isolation of $3$-vertex paths
por: Bartolo, Karl, et al.
Publicado: (2025)

Cycles of weight divisible by $k$
por: Diwan, Ajit A.
Publicado: (2024)

Totally equimodular matrices: decomposition and triangulation
por: Chervet, Patrick, et al.
Publicado: (2025)

Isometric Cycles and a Generalization of Moore Graphs
por: Preez, Brandon Du
Publicado: (2024)

The degree-diameter problem for plane graphs with pentagonal faces
por: Preez, Brandon Du
Publicado: (2024)

Isolation of squares in graphs
por: Bartolo, Karl, et al.
Publicado: (2023)

Adaptive Improvements of Multi-Objective Branch and Bound
por: Bauß, Julius, et al.
Publicado: (2023)

Isolation of non-triangle cycles in graphs
por: Borg, Peter, et al.
Publicado: (2025)

Longest cycles in vertex-transitive and highly connected graphs
por: Groenland, Carla, et al.
Publicado: (2024)

Cops and robbers on $2K_2$-free graphs
por: Turcotte, Jérémie
Publicado: (2020)

Awesome graph parameters
por: Štorgel, Kenny Bešter, et al.
Publicado: (2025)

Excluding an induced wheel minor in graphs without large induced stars
por: Choi, Mujin, et al.
Publicado: (2025)

Edge coloring of products of signed graphs
por: Janczewski, Robert, et al.
Publicado: (2023)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
por: Baghirova, Narmina, et al.
Publicado: (2025)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

A Menger-type theorem for two induced paths
por: Albrechtsen, Sandra, et al.
Publicado: (2023)