Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
From MaRDI portal
Publication:2357161
DOI10.1016/j.dam.2016.01.011zbMath1365.05112OpenAlexW2284692659MaRDI QIDQ2357161
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.011
Related Items (2)
On lengths of edge-labeled graph expressions ⋮ Estimation of expressions' complexities for two-terminal directed acyclic graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functions computed by monotone Boolean formulas with no repeated variables
- Generalized Fibonacci maximum path graphs
- Planar orientations with low out-degree and compaction of adjacency matrices
- Solution of Rota's problem on the order of series-parallel networks
- Coloring inductive graphs on-line
- Scheduling UET-UCT series-parallel graphs on two processors
- Recursively constructible families of graphs
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- 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
- Emergence of Scaling in Random Networks
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- The number of Boolean functions computed by formulas of a given size
- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
This page was built for publication: Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
