Pages that link to "Item:Q3491289"
From MaRDI portal
The following pages link to A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289):
Displaying 11 items.
- Path-closed sets (Q802569) (← links)
- On computing graph closures (Q1120287) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- Optimal mechanism design for the private supply of a public good (Q2435905) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- The Parametric Closure Problem (Q3449830) (← links)
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph (Q3474202) (← links)
- (Q5289457) (← links)
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)