2016
DOI: 10.1016/j.procs.2016.05.314
|View full text |Cite
|
Sign up to set email alerts
|

Hypergraph Grammars in Non-stationary hp- adaptive Finite Element Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Originally developed from string-based formal languages, graph grammar is a two-dimensional formal method that is used for graph generation and parsing by derivation and reduction. Graph grammars have been used in many applications [1][2][3][4][5][6][7][8], such as web pattern specification [1] and validation of floor plans [2]. However, most graph grammars focus on the specification of abstract graphs and ignore the specification of the physical layouts of graphs.…”
Section: Introductionmentioning
confidence: 99%
“…Originally developed from string-based formal languages, graph grammar is a two-dimensional formal method that is used for graph generation and parsing by derivation and reduction. Graph grammars have been used in many applications [1][2][3][4][5][6][7][8], such as web pattern specification [1] and validation of floor plans [2]. However, most graph grammars focus on the specification of abstract graphs and ignore the specification of the physical layouts of graphs.…”
Section: Introductionmentioning
confidence: 99%