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):
Displaying 26 items.
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- 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)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Almost exact matchings (Q2429356) (← links)
- Pfaffian orientations and perfect matchings of scale-free networks (Q2514127) (← links)
- An NC algorithm for the perfect matching problem in larger cycle-free graphs (Q2741350) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- (Q3732972) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- (Q5091009) (← links)
- Parallel algorithms for matroid intersection and matroid parity (Q5261053) (← links)
- Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)