Pages that link to "Item:Q1120597"
From MaRDI portal
The following pages link to NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597):
Displayed 10 items.
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
- On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)