Pages that link to "Item:Q1041773"
From MaRDI portal
The following pages link to Self-stabilizing coloration in anonymous planar networks (Q1041773):
Displaying 7 items.
- An efficient self-stabilizing distance-2 coloring algorithm (Q442253) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- An Efficient Self-stabilizing Distance-2 Coloring Algorithm (Q3408175) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
