A New Algorithm for Computing the Maximal Closure of a Graph
From MaRDI portal
Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
- A new algorithm for the maximum clique problem
- Algorithm Theory - SWAT 2004
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- A note on computing graph closures
- On computing graph closures
- A new algorithm for the maximum-weight clique problem
- scientific article; zbMATH DE number 1786225
- On the computational complexity of graph closures
- scientific article; zbMATH DE number 279491
- A New Approach for Solving the Maximum Clique Problem
Cited in
(11)- On computing graph closures
- On the computational complexity of graph closures
- A new variant of the \(A^*\)-algorithm which closes a node at most once.
- Maximal closure on a graph with resource constraints
- Optimal mechanism design for the private supply of a public good
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph
- scientific article; zbMATH DE number 3910419 (Why is no real title available?)
- scientific article; zbMATH DE number 279491 (Why is no real title available?)
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
- Path-closed sets
This page was built for publication: A New Algorithm for Computing the Maximal Closure of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491289)
