scientific article
From MaRDI portal
Publication:2934691
zbMath1302.68123MaRDI QIDQ2934691
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items
All-pairs bottleneck paths in vertex weighted graphs ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Algebraic methods in the congested clique ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ An exact algorithm for subgraph homeomorphism
