scientific article; zbMATH DE number 4147519
From MaRDI portal
Publication:3477966
Recommendations
- Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
- Graph models for PLA folding problems
- Graph folding and programmable logic array
- Graph theoretic analysis of PLA folding heuristics
- Graph layout problems
- PLA folding in special graph classes
- scientific article; zbMATH DE number 4189751
- scientific article; zbMATH DE number 6289085
- A framework for solving VLSI graph layout problems
- scientific article; zbMATH DE number 88981
Cited in
(62)- Derivation of algorithms for cutwidth and related graph layout parameters
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
- -vertex separator is NP-hard even for 3-regular graphs
- Narrowness, pathwidth, and their application in natural language processing
- A partial k-arboretum of graphs with bounded treewidth
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Triangulating graphs with few \(P_4\)'s
- On the pathwidth of chordal graphs
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- A generalized insertion algorithm for the seriation problem
- PLA folding in special graph classes
- A column generation approach to job grouping for flexible manufacturing systems
- Characterizations and algorithmic applications of chordal graph embeddings
- Fugitive-search games on graphs and related parameters
- Helicopter search problems, bandwidth and pathwidth
- Triangulating multitolerance graphs
- Bridge obstructions to circular-three gate matrix layout
- Interval degree and bandwidth of a graph
- On the monotonicity of games generated by symmetric submodular functions.
- Edge and node searching problems on trees
- Algorithms and obstructions for linear-width and related search parameters
- On the orderability problem for PLA folding
- Triangulating graphs without asteroidal triples
- Approximate search strategies for weighted trees
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- On tradeoffs between width- and fill-like graph parameters
- Graph theoretic analysis of PLA folding heuristics
- Node-searching problem on block graphs
- Linear layouts measuring neighbourhoods in graphs
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A heuristic and an exact method for the gate matrix connection cost minimization problem
- scientific article; zbMATH DE number 4205984 (Why is no real title available?)
- Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
- Searching expenditure and interval graphs
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- Intervalizing \(k\)-colored graphs
- How to use the minimal separators of a graph for its chordal triangulation
- Graph models for PLA folding problems
- The complexity of minimum-length path decompositions
- Memory requirements for table computations in partial k-tree algorithms
- The pathwidth and treewidth of cographs
- A linear fixed parameter tractable algorithm for connected pathwidth
- The interval order polytope of a digraph
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- A 3-approximation for the pathwidth of Halin graphs
- On a solution of a randomized three tracks variant of the Gate Matrix Layout problem
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Connected search for a lazy robber
- Fugitive-search games on graphs and related parameters
- Graph searching on chordal graphs
- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
- A simple linear-time algorithm for finding path-decompositions of small width
- Mixed searching and proper-path-width
- Graph parameters, universal obstructions, and WQO
- Connected graph searching
- Fifty years of operational research: 1972--2022
- An overview of universal obstructions for graph parameters
- A linear time algorithm to list the minimal separators of chordal graphs
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- The complexity of zero-visibility cops and robber
- An annotated bibliography on guaranteed graph searching
- CSP duality and trees of bounded pathwidth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477966)
