Graph Coverings
Graph Coverings is a method in compiler design that decomposes an abstract syntax tree into a set of pattern-matching rules over intermediate code graphs to systematically select optimal instruction sequences during code generation.
77
Publications
3.3K
Citations
129
Authors
92
Institutions
Publications per year
2017–2026
7
77
Some covering concepts in graphs
Michael D. Plummer · Journal of Combinatorial Theory · 1970 · 223 citations
On the Sandpile Group of Dual Graphs
Robert Cori, Dominique Rossin · European Journal of Combinatorics · 2000 · 169 citations
COVERING AND PACKING IN GRAPHS, I.
Frank Harary · Annals of the New York Academy of Sciences · 1970 · 140 citations
1–5 of 77
129
8
h-index
8
h-index
4
h-index
3
h-index
3
h-index
1–5 of 129
92
Pohang University of Science and Technology
Pohang, South Korea
6 h-index
8 publications
226 citations

University of Maribor
Maribor, Slovenia
5 h-index
8 publications
181 citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
5 h-index
9 publications
196 citations

Yeungnam University
Daegu, South Korea
4 h-index
4 publications
92 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
4 h-index
5 publications
277 citations

University of Warsaw
Warsaw, Poland
3 h-index
4 publications
107 citations
Université de Bordeaux
Bordeaux, France
3 h-index
4 publications
262 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
242 citations
1–8 of 92
13 publications · 581 citations
12
h-index
TRAN · 4 publications · 223 citations
4
h-index
4 publications · 99 citations
4
h-index
4 publications · 90 citations
4
h-index
3 publications · 118 citations
3
h-index
1–5