Series-parallel graphs may be recognized in linear time and their series-parallel decomposition may be constructed in linear time as well. See en.wikipedia.org/wiki/Series-parallel_graph. Reference 3 in that article may be what you are looking for.
Dave On Nov 14, 5:31 am, fpalamariu <[EMAIL PROTECTED]> wrote: > Hi, > > i need a little help with an algorithm... an algorithm to recognize a > series-parallel graph using (a adaptation probably) the algorithm for > detecting articulation points in a graph. I have no ideea how this > finally algoritm might look.... i've open a lot of books on graph > theory.... data design... and nothing... > > so i ask for your help... because my algorithm solving abilities sucks > hard. > > thank's --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
