Results 61 to 70 of about 335 (76)
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
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
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
Coloring by tabu branch and bound
Cliques, Coloring, and Satisfiability, 1993 F. Glover, Mark Parker, J. Ryan
semanticscholar +1 more source
New upper bounds on the probability of events based on graph structures
, 2007 B. Vizvári
semanticscholar +1 more source
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
Valid inequalities and cutting planes for some polytopes
, 1998 S. Stefanov
semanticscholar +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
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