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)
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items
Using relation-algebraic means and tool support for investigating and computing bipartitions ⋮ Applying relational algebra and REL VIEW to coalition formation ⋮ Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
Cites Work