Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs

DOI10.1007/s10288-005-0067-9zbMath1083.05021OpenAlexW2077380800MaRDI QIDQ816574

Youcef Saoula, Moncef Abbas

Publication date: 9 March 2006

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-005-0067-9

zbMATH Keywords

digraphMeyniel orientationnormal orientation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On the kernel and related problems in interval digraphs ⋮ Perfect graphs with polynomially computable kernels

This page was built for publication: Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs