Constructing a perfect matching is in random NC
Combinatorica
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Matching is as easy as matrix inversion
Combinatorica
A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
Theoretical Computer Science
NC algorithms for computing the number of perfect matchings in K3,3-free graph and related problems
Information and Computation
The graph genus problem is NP-complete
Journal of Algorithms
Parallel tree contraction part 2: further applications
SIAM Journal on Computing
Sublinear-time parallel algorithms for matching and related problems
Journal of Algorithms
On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs
Journal of Algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Flow in Planar Graphs with Multiple Sources and Sinks
SIAM Journal on Computing
Handbook of combinatorics (vol. 1)
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
An efficient parallel algorithm for maximum matching for some classes of graphs
Journal of Parallel and Distributed Computing
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
SIAM Journal on Discrete Mathematics
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
The Matching Problem for Strongly Chordal Graphs is in $NC$
The Matching Problem for Strongly Chordal Graphs is in $NC$
A combinatorial algorithm for Pfaffians
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |