Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2861540
Jump to:navigation, search

zbMath1274.90332MaRDI QIDQ2861540

Walid Ben-Ameur, Michał Pióro, Mateusz Żotkiewicz

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001411

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)


Related Items (1)

On the hop-constrained survivable network design problem with reliable edges



Cites Work

  • A note on two problems in connexion with graphs
  • A quick method for finding shortest pairs of disjoint paths
  • Disjoint paths in a network
  • Unnamed Item
  • Unnamed Item


This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2861540&oldid=15796716"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki