Path Problems in Complex Networks (Q2913787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-1-4614-0754-6_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W67529702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-varying shortest path problems with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear broadcast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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: A Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding paths with multiple constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight paths in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed shortest-path protocols for time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving k-shortest and constrained shortest path problems efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiroute maximum flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding two disjoint paths with min-max objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for computing shortest pairs of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick method for finding shortest pairs of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709155 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Path Problems in Complex Networks
scientific article

    Statements

    Path Problems in Complex Networks (English)
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    path computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers