Generating irregular partitionable data structures
From MaRDI portal
Publication:1575237
DOI10.1016/S0304-3975(98)00226-6zbMath0944.68078MaRDI QIDQ1575237
C. Verbrugge, Prakash Panangaden
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Uses Software
Cites Work
- On structured graph grammars. I
- On graph rewritings
- Boundary graph grammars with dynamic edge relabeling
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- On ``On graph rewritings
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- A characterization of context-free string languages by directed node- label controlled graph grammars
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
- Graph grammars with neighbourhood-controlled embedding
- Edge separators for graphs of bounded genus with applications
- Automata, languages and programming. 15th international colloquium (EATCS), Tampere, Finland, July 11-15, 1988. Proceedings
- Hypergraph languages of bounded degree
- Treewidth. Computations and approximations
- LEAN: An intermediate language based on graph rewriting
- The complexity of graph languages generated by hyperedge replacement
- On structured graph grammars. II
- Handle-rewriting hypergraph grammars
- On sequential and parallel node-rewriting graph grammars
- A class of bounded approximation algorithms for graph partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- On sequential and parallel node-rewriting graph grammars, II
- Graph minors. II. Algorithmic aspects of tree-width
- A Separator Theorem for Planar Graphs
- Locality in Distributed Graph Algorithms
- Partitioning Planar Graphs
- Edge Separators of Planar and Outerplanar Graphs With Applications
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Linear Tree Partitioning Algorithm
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Planar Separators
- Finding k Cuts within Twice the Optimal
- Efficient Algorithm for the Partitioning of Trees
- Syntax and semantics of hybrid database languages
- Graph-grammar semantics of a higher-order programming language for distributed systems
- Separable graphs, planar graphs and web grammars
- Lower Bounds for the Partitioning of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generating irregular partitionable data structures
