scientific article
From MaRDI portal
Publication:3972950
zbMath0747.05046MaRDI QIDQ3972950
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Edge separators for quasi-binary trees ⋮ Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ Sparse universal graphs for planarity ⋮ Packing topological minors half‐integrally ⋮ \(N\)-separators in planar graphs ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Equipartitions of graphs ⋮ New graph decompositions with applications to emulations ⋮ Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ Isometric Universal Graphs ⋮ Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
This page was built for publication:
