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:2754199
Jump to:navigation, search

zbMath0973.05071MaRDI QIDQ2754199

Hristo N. Djidjev

Publication date: 11 November 2001


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


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (3)

On the negative cost girth problem in planar networks ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2754199&oldid=15630923"
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 15:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki