### 5 papers:

- ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate #bound
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
- ICGT-2002-GodardMMS #algorithm #detection #distributed #graph #termination
- Termination Detection of Distributed Algorithms by Graph Relabelling Systems (EG, YM, MM, AS), pp. 106–119.
- ICGT-2002-HabelP #graph transformation
- Relabelling in Graph Transformation (AH, DP), pp. 135–147.
- FoSSaCS-1998-BottreauM #graph #normalisation
- Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling (AB, YM), pp. 110–124.
- GG-1990-LitovskyM #graph
- Computing with Graph Relabelling Systems with Priorities (IL, YM), pp. 549–563.