The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout.
Piotr BermanAndrew B. KahngDevendra VidhaniAlexander ZelikovskyPublished in: WADS (1999)
Keyphrases
- graph layout
- signal processing
- gaussian graphical models
- vlsi circuits
- sparse data
- high dimensional
- directed acyclic
- vlsi design
- join algorithms
- graph matching
- query optimization
- cartesian product
- sparse representation
- graph structure
- proximity graph
- high speed
- layout design
- learning phase
- graph theoretic
- graph representation
- training phase
- phase unwrapping
- graphical models
- undirected graph
- graph model
- graph mining
- np hard
- query processing
- database