Estimation of expressions' complexities for two-terminal directed acyclic graphs

DOI10.1016/j.endm.2017.11.005zbMath1383.05133OpenAlexW2773816382MaRDI QIDQ2413344

Mark Korenblit, Vadim E. Levit

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.005

zbMATH Keywords

complexityseries-parallel graphtwo-terminal directed acyclic graphedge-labeled graphalgebraic expression

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On lengths of edge-labeled graph expressions

Uses Software

• JBool

Cites Work

• Generalized Fibonacci maximum path graphs
• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
• Factoring Boolean functions using graph partitioning
• Topology of series-parallel networks
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Unnamed Item

This page was built for publication: Estimation of expressions' complexities for two-terminal directed acyclic graphs