One-dimensional logic gate assignment and interval graphs
From MaRDI portal
Cited in
(24)- On minimal augmentation of a graph to obtain an interval graph
- Narrowness, pathwidth, and their application in natural language processing
- Helicopter search problems, bandwidth and pathwidth
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- Generating lower bounds for the linear arrangement problem
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Computing the weighted isolated scattering number of interval graphs in polynomial time
- A polynomial algorithm for weighted scattering number in interval graphs
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- Topological Bandwidth
- Linear placement algorithms and applications to VLSI design
- Polynomial-time self-reducibility: theoretical motivations and practical results∗
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
- The k-neighbourhood-covering problem on interval graphs
- Edge-vertex domination on interval graphs
- Isolated scattering number can be computed in polynomial time for interval graphs
- Optimal blocks for maximizing the transaction fee revenue of bitcoin miners
- On minimizing width in linear layouts
- Routing with critical paths
- An optimal greedy heuristic to color interval graphs
This page was built for publication: One-dimensional logic gate assignment and interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050329)
