Pages that link to "Item:Q3773334"
From MaRDI portal
The following pages link to Complexité de problèmes liés aux graphes sans circuit (Q3773334):
Displaying 7 items.
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Transitive reduction of a nilpotent Boolean matrix (Q800374) (← links)
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés (Q1073816) (← links)
- Connectedness and acyclicity of the transposed square of a graph (Q1078583) (← links)
- On best transitive approximations to simple graphs (Q1762840) (← links)