Pages that link to "Item:Q2235770"
From MaRDI portal
The following pages link to Polynomial-time algorithms for submodular Laplacian systems (Q2235770):
Displaying 8 items.
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
- Finding Cheeger cuts in hypergraphs via heat equation (Q2166752) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Nonlinear evolution equation associated with hypergraph Laplacian (Q6179902) (← links)
- Heat equation on the hypergraph containing vertices with given data (Q6607367) (← links)