Generating irregular partitionable data structures (Q1575237): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Planar Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax and semantics of hybrid database languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEAN: An intermediate language based on graph rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-grammar semantics of a higher-order programming language for distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Separators of Planar and Outerplanar Graphs With Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary graph grammars with dynamic edge relabeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph languages of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of bounded approximation algorithms for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of node-label-controlled graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions, extensions, and variations of NLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of context-free string languages by directed node- label controlled graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars with neighbourhood-controlled embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential and parallel node-rewriting graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential and parallel node-rewriting graph grammars, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ``On graph rewritings'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structured graph grammars. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structured graph grammars. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Tree Partitioning Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of graph languages generated by hyperedge replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, languages and programming. 15th international colloquium (EATCS), Tampere, Finland, July 11-15, 1988. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithm for the Partitioning of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable graphs, planar graphs and web grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge separators for graphs of bounded genus with applications / rank
 
Normal rank

Latest revision as of 13:10, 30 May 2024

scientific article
Language Label Description Also known as
English
Generating irregular partitionable data structures
scientific article

    Statements

    Generating irregular partitionable data structures (English)
    0 references
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    graph grammars
    0 references
    irregular data structures
    0 references
    partitionability
    0 references
    parallelism
    0 references
    dynamic data structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references