Results 61 to 70 of about 327 (90)
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
, 2009 One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs.
Erdős, Péter L. +2 more
core +2 more sources
Detecting induced subgraphs [PDF]
An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one).
Benjamin Lévêque +3 more
core
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
A genetic algorithm for the arrival probability in the stochastic networks. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]
Math ProgramÇela E +4 more
europepmc +1 more source
Del poliedro del agente viajero gráfico al de rutas de vehículos con demanda compartida [PDF]
, 2000 Martínez Blázquez, M. Carmen +1 more
core +2 more sources