The following pages link to (Q4252334):
Displaying 8 items.
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- Optimal bandwidth utilization of all-optical ring with a converter of degree 4. (Q1850660) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
