Pages that link to "Item:Q3050329"
From MaRDI portal
The following pages link to One-dimensional logic gate assignment and interval graphs (Q3050329):
Displaying 21 items.
- On minimizing width in linear layouts (Q751660) (← links)
- Routing with critical paths (Q910228) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Computing the weighted isolated scattering number of interval graphs in polynomial time (Q2325144) (← links)
- A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
- Refinements on an enumeration scheme for solving a pattern sequencing problem (Q3158869) (← links)
- Topological Bandwidth (Q3691781) (← links)
- Linear placement algorithms and applications to VLSI design (Q3783832) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs (Q4498117) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
