Computing kernels in directed bichromatic graphs

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Bichromaticity; Bipartiteness; Computing kernels; Directed graphs; Relation algebra; Richardson's theorem

Document Type: Research Article


Affiliations: Institut fur Informatik und Praktische Mathematik, Christian-Albrechts-Universitat Kiel, Preusserstrasze 1-9, D-24105 Kiel, Germany

Publication date: April 14, 1997

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more