Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

graph rewriting · Vinony

EntityQ1508564· pop 6· linked from 184 articles

graph rewriting

Sign in to save

Techniques for algorithmically creating a new graph from an existing graph

Connections

formal verification

computer science

International Standard Book Number

Wayback Machine

digital object identifier

International Standard Serial Number

software engineering

object-oriented programming

functional programming

parallel computing

Categories

Graph rewriting

Sources

wikipedia.externallinksexternallink

What links here184 pages

visual programming language

end-user development

distributed computing

data-driven programming

prototype-based programming

systems programming language

answer set programming

reflective programming

tacit programming

non-structured programming

purely functional programming

stream processing

context-sensitive grammar

command language

model transformation

low-code development platform

value-level programming

concurrent computing

list of CLI languages

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.47

subdivision of a graph

Entitydist 0.47

complement graph

Entitydist 0.52

digraphs and trigraphs

Entitydist 0.55

blossom algorithm

Entitydist 0.56

graph toughness

Entitydist 0.56

planar straight-line graph

Entitydist 0.57

uniform-cost search

Entitydist 0.57

Dijkstra's algorithm

Entitydist 0.57

Entitydist 0.58

Entitydist 0.59

Entitydist 0.59