chip design.
* Another application is in complexity theory. Some computational problems on graphs are NP-hard in general, but can be solved in polynomial time for graphs with bounded FVS number. Some examples are graph isomorphism and the path reconfiguration problem.

Notes

References

Research articles

*.
*
*
*
*
*
*
*
*
*
*
*
*
*

Textbooks and survey articles

*
*
*

1.Previous
3.Next