Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems

DOI10.1007/11786986_24zbMath1223.05302OpenAlexW2161863751MaRDI QIDQ3613765

Raphael Yuster, Virginia Vassilevska Williams, R. Ryan Williams

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_24

zbMATH Keywords

algorithmweighted graphsfast matrix multiplicationvertex weighted graphsrectangular matrix multiplicationedge weigted graphsminimum weight subgraphsmallest cycle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (4)

All-pairs bottleneck paths in vertex weighted graphs ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs

This page was built for publication: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems