The point-to-point connection problem - analysis and algorithms (Q1377667): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-to-point delivery and connection problems: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum equivalent graph of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the point-to-point connection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiently solvable case of the minimum weight equivalent subgraph problem / rank
 
Normal rank

Latest revision as of 10:30, 28 May 2024

scientific article
Language Label Description Also known as
English
The point-to-point connection problem - analysis and algorithms
scientific article

    Statements