A note on computing graph closures

DOI10.1016/S0012-365X(03)00316-9MaRDI QIDQ1422436zbMATH OpenFDO

Authors Jeremy P. Spinrad

Publication date 14 February 2004

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

AlgorithmGraph closure

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 426157 (Why is no real title available?)
• scientific article; zbMATH DE number 219266 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• A generalization of the Bondy-Chvátal theorem on the k-closure
• A method in graph theory
• A note on the computation on the k-closure of a graph
• Closure concepts: A survey
• Independence trees and Hamilton cycles
• On computing graph closures
• On the computational complexity of graph closures

Cited in

(6)

• Exploiting c-Closure in Kernelization Algorithms for Graph Problems
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
• On graph closures
• On the computational complexity of graph closures
• A formal context for closures of acyclic hypergraphs
• A New Algorithm for Computing the Maximal Closure of a Graph

This page was built for publication: A note on computing graph closures

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