Computing kernels in directed bichromatic graphs
From MaRDI portal
Publication:287022
DOI10.1016/S0020-0190(97)00035-5zbMath1336.68206MaRDI QIDQ287022
Rudolf Berghammer, Burghard von Karger
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
relation algebra; directed graphs; bipartiteness; bichromaticity; computing kernels; Richardson's theorem
91A43: Games involving graphs
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
03G15: Cylindric and polyadic algebras; relation algebras
Related Items
Applying relational algebra and REL VIEW to coalition formation, Combining relational calculus and the Dijkstra-Gries method for deriving relational programs