The following pages link to Jean R. S. Blair (Q442252):
Displaying 24 items.
- An efficient self-stabilizing distance-2 coloring algorithm (Q442253) (← links)
- River routing with a generalized model (Q676455) (← links)
- The efficiency of AC graphs (Q686253) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- The benefits of external wires in single row routing (Q1183431) (← links)
- (Q1589425) (redirect page) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Domination equivalence in graphs (Q2369388) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- (Q3089221) (← links)
- (Q3378248) (← links)
- An Efficient Self-stabilizing Distance-2 Coloring Algorithm (Q3408175) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- (Q3635574) (← links)
- (Q3727400) (← links)
- (Q4288578) (← links)
- Making an arbitrary filled graph minimal by removing fill edges (Q4375644) (← links)
- (Q4414480) (← links)
- (Q4677956) (← links)
- (Q4764622) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5918513) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
