Parallel algorithms for maximum matching in complements of interval graphs and related problems
From MaRDI portal
Publication:1969958
DOI10.1007/s004539910013zbMath0949.68176OpenAlexW1988081733MaRDI QIDQ1969958
Publication date: 19 March 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cstech/1421
Related Items (3)
Recognizing and representing proper interval graphs in parallel using merging and sorting ⋮ ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS ⋮ Mutual exclusion scheduling with interval graphs or related classes. I
This page was built for publication: Parallel algorithms for maximum matching in complements of interval graphs and related problems
