The following pages link to Johann Hagauer (Q686276):
Displayed 13 items.
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- (Q787678) (redirect page) (← links)
- It is decidable whether a regular language is pure context-free (Q787679) (← links)
- On form-equivalence of deterministic pure grammar forms (Q1164436) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Clique-gated graphs (Q1356418) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- (Q3088443) (← links)
- (Q4028106) (← links)
- (Q4374717) (← links)
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs (Q4847142) (← links)
- Recognizing binary Hamming graphs inO(n 2 logn) time (Q4850329) (← links)