Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |