Chain Graphs have Unbounded Readability

From MaRDI portal

Chain Graphs have Unbounded Readability (scientific article from arXiv)

Jump to:navigation, search

MaRDI QIDQ7044148arXivFDO

Authors Martin Charles Golumbic, Uri N. Peled, Udi Rotics

Publication date 2006

Published in arXiv

arXiv classification

This page was built for publication: Chain Graphs have Unbounded Readability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7044148)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Chain_Graphs_have_Unbounded_Readability_(scientific_article_from_arXiv)&oldid=106155458"