Abstract
We investigate some properties of minimal interval and circular arc representations and give several optimal sequential and parallel recognition and construction algorithms. We show that, among other things, given ans×tinterval or circular arc representation matrix, •deciding if the representation is minimal can be done inO(logs) time withO(st/logs) EREW PRAM processors, or inO(1) time withO(st) common CRCW PRAM processors; •constructing an equivalent minimum interval representation can be done inO(log(st)) time withO(st/log(st)) EREW PRAM processors, or inO(logt/loglogt) time withO(stloglogt/logt) common CRCW PRAM processors, or inO(1) time withO(st) BSR processors; •constructing an equivalent minimal circular arc representation can be done inO(st) time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
