scientific article
From MaRDI portal
Publication:3732972
zbMath0598.68050MaRDI QIDQ3732972
Umesh V. Vazirani, Dexter Kozen, Vijay V. Vazirani
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Coloring permutation graphs in parallel, A theorem on permutation graphs with applications, Matching is as easy as matrix inversion, Constructing a perfect matching is in random NC, SCHEDULING INTERVAL ORDERS IN PARALLEL, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs, An nc algorithm to recognize hhd-free graphs, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, On the determinant of bipartite graphs, Unnamed Item, A fast parallel algorithm to recognize partitionable graphs, Deterministically isolating a perfect matching in bipartite planar graphs, New sequential and parallel algorithms for interval graph recognition, Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem, Characterization and complexity of uniformly nonprimitive labeled 2-structures, The weighted maximum independent set problem in permutation graphs, Matching theory -- a sampler: From Dénes König to the present, Finding a maximum matching in a circular-arc graph, A simple nc algorithm to recognize weakly triangulated graphs, Parallel algorithms for permutation graphs
