Minimal functional routes in directed graphs with dependent edges (Q4924061): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.12007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034939140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast path-finding algorithms in AND-OR graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Algorithms for Functional Dependency Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combined effect of connectivity and dependency links on percolation of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimum makespan assembly plans / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(K\) shortest hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> Shortest Simple Paths Problem in Weighted Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all simple paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for computing longest paths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypernetworks in a directed hypergraph / rank
 
Normal rank

Latest revision as of 12:05, 6 July 2024

scientific article; zbMATH DE number 6168600
Language Label Description Also known as
English
Minimal functional routes in directed graphs with dependent edges
scientific article; zbMATH DE number 6168600

    Statements

    Minimal functional routes in directed graphs with dependent edges (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2013
    0 references
    graph search algorithms
    0 references
    minimal functional routes
    0 references
    directed graphs
    0 references
    dependent edges
    0 references

    Identifiers