Efficient coding of labeled directed acyclic graphs

DOI10.1007/S00500-002-0223-5MaRDI QIDQ1762604zbMATH OpenOpenAlexFDO

Authors Bertran Steinsky

Publication date 11 February 2005

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-002-0223-5

zbMATH Keywords

rankBayesian networkalgorithmenumerationlabeled directed acyclic graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On ranking and unranking labeled digraphs
• Random generation of essential directed acyclic graphs
• Random Generation of Directed Acyclic Graphs
• Ranking, unranking and random generation of extensional acyclic digraphs
• LATIN 2004: Theoretical Informatics

Cited in

(8)

• On ranking and unranking labeled digraphs
• Network coding in undirected graphs is either very helpful or not helpful at all
• Directed acyclic graphs with the unique dipath property
• Random generation of essential directed acyclic graphs
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Clustering a DAG for CAD databases
• scientific article; zbMATH DE number 4139806 (Why is no real title available?)
• Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets

This page was built for publication: Efficient coding of labeled directed acyclic graphs

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