Live briefing
Everything about Graph rewriting
Creating a new graph from an existing graph
In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering to layout algorithms and picture generation. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph rewritingA 5-minute orientation
- Skim a recent paper: Short-term wind speed forecasting based on spatial-temporal graph transformer networksInfluential work since 2022
- Pick up a classic book: Computational Linguistics and Intelligent Text ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Graph neural news recommendation with long-term and short-term interest modelingCited 190 times
- Go sideways: Double pushout graph rewritingA closely related topic
- Go sideways: Attributed graph grammarA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Graph neural news recommendation with long-term and short-term interest modeling
Graph-based term weighting for information retrieval
EQUATIONAL TERM GRAPH REWRITING
LCDFormer: Long-term correlations dual-graph transformer for traffic forecasting
Classification of two-term tilting complexes over Brauer graph algebras
Long-term spatio-temporal graph attention network for traffic forecasting
Long-term sequence dependency capture for spatiotemporal graph modeling
Aspect Term Extraction using Graph-based Semi-Supervised Learning
🆕 Influential since 2022
Short-term wind speed forecasting based on spatial-temporal graph transformer networks
Short-term residential load forecasting using Graph Convolutional Recurrent Neural Networks
Contrastive graph learning long and short-term interests for POI recommendation
Short-Term Passenger Flow Prediction Using a Bus Network Graph Convolutional Long Short-Term Memory Neural Network Model
Short-term load forecasting using spatial-temporal embedding graph neural network
📚 Books worth reading
Computational Linguistics and Intelligent Text ProcessingAlexander Gelbukh · 2003
Discrete Mathematics and Its ApplicationsKenneth H. Rosen · 1988
Natural Language Processing and Information SystemsElisabeth Métais · 2005
Foundations and Practice of SecurityJoaquin Garcia-Alfaro · 2012
Painless Algebra (Painless)Lynette Long, Lynette Long Ph.D. · 1998
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Saxon Math 8/7Stephen Hake · 2003
Introduction to information retrievalChristopher D. Manning, Prabhakar Raghavan · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Double pushout graph rewriting In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced…
- Attributed graph grammar In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions…
- Term graph A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms[clarification needed]. Term graphs…
- Single pushout graph rewriting In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast…
- Subgraph isomorphism problem In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle…
- Regulated rewriting Regulated rewriting is a specific area of formal languages studying grammatical systems which are able to take some kind of control over the production…
- Hartmut Ehrig Hartmut Ehrig (born 6 December 1944 in Angermünde; died 17 March 2016) was a German computer scientist and professor of theoretical computer science and…
- L-system An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can…