Abstract
We propose the use of SPQR-trees as a data structure to encode the 3-connected components of a graph and to obtain linear-time recognition algorithms for graph classes structurally characterized by 2-cutset decompositions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
