Efficient parallel algorithms for bipartite permutation graphs

DOI10.1002/net.3230230105zbMath0795.90078OpenAlexW2011975791MaRDI QIDQ5285476

Lin Chen, Yaacov Yesha

Publication date: 29 June 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230105

zbMATH Keywords

parallel processingpermutation graphinput bipartite graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Parallel numerical computation (65Y05)

Related Items

Permuting matrices to avoid forbidden submatrices ⋮ On the recognition of permuted bottleneck Monge matrices ⋮ On orthogonal ray graphs ⋮ Perspectives of Monge properties in optimization ⋮ On opposition graphs, coalition graphs, and bipartite permutation graphs ⋮ Optimal computation of shortest paths on doubly convex bipartite graphs ⋮ Graph isomorphism and identification matrices: Sequential algorithms ⋮ Efficient parallel algorithms for doubly convex-bipartite graphs ⋮ Solving the shortest-paths problem on bipartite permutation graphs efficiently ⋮ Efficient parallel recognition of some circular arc graphs. II ⋮ Recognition and drawing of stick graphs ⋮ A selected tour of the theory of identification matrices ⋮ OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS

Cites Work

• Incidence matrices and interval graphs
• Unnamed Item
• Unnamed Item