scientific article; zbMATH DE number 139779

zbMATH Open0768.68162MaRDI QIDQ4028102FDOQ4028102

Authors: Tze-Heng Ma, Jeremy P. Spinrad 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• BetweenO(nm) andO(n^alpha)
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
• Complexité de problèmes liés aux graphes sans circuit
• Algorithms – ESA 2004
• Fast sparse matrix multiplication

zbMATH Keywords

directed acyclic graphpartial ordersmatrix multiplicationneighborhoodtransitive closureefficient algorithmstrapezoid graphschordal comparability graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Computing equivalence classes among the edges of a graph with applications
• On the structure of trapezoid graphs
• BetweenO(nm) andO(n^alpha)
• Unified all-pairs shortest path algorithms in the chordal hierarchy
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028102)