Abstract A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a
NP-CompletenessofSomeTree-ClusteringProblems


289
(b)(c)
Figure1.Drawingsofatreeofpaths
ofcyclesandsoon.Itiseasytoseethateveryn×m-gridisapathofpathsandevery2n×2n-gridisapathofcycles.Tothecontraryeverycliquewithmorethanfourverticesisneitherapathofpathsnoratreeofpaths.
Two-levelclusteredgraphshavebeende nedinasyntacticwaybyKratochv´ let.al.[12].Theycanbedrawnaccordingtotheirstructure:OnthetopleveldrawtheX-graphandonthesecondleveltheY-graphs(see[3]formoredetails).Theobtaineddrawingre ectsthenatureofthegraphandconsiderablysimpli esitsunderstanding.AnexampleforatreeofpathsisshowninFigure1(a)withthicklinesindicatingthepaths.Thedrawings(b)and(c)aregeneratedbythealgorithmsfrom[8]and[15]respectively.
Themainproblemistodeterminewhetherornotagraphisatwo-levelclus-teredgraph.Complexityconsiderationsconcerningtwo-levelclusteredgraphsarenotknowntobeinvestigatedinliterature.Tothecontrarythereisagreatquantityofcomplexityresultsconcerningforexamplepartitioningofgraphs,seeGT11-GT16in[9],orcoveringofgraphs,seeGT17andGT18in[9].Thisresearchisstillinprogress[4,5].InfactalmostallnontrivialpartitioningandcoveringproblemsofgraphsareNP-complete.Partitioningsandcoveringsaretwo-levelclusteringsinwhichthe rstlevelgraphs(X-graphs)arearbitrary.Hence,two-levelclusteringisarestrictiveversionofpartitioningandcovering.TherestrictioncanleadtoremovingtheNP-completeness.ForexampletheproblemwhetherornotagraphisapartitionintocliquesisNP-complete(seeGT15in[9]),whereastheproblemswhetherornotagraphisapathofcliquesoralargecycleofcliquesareinP,asshownin[3].Thus,itcannotalwaysbeexpectedthateverynontrivialtwo-levelclusteringproblemisNP-complete.
Inthispaperweconsidertreesofpathsandtreesofcycles.WeshowthatgivenagraphGthequestionwhetherornotGisatreeofpaths(cycles)isNP-complete.Moreover,ifthelengthofthepaths(cycles)isbounded,wegiveapolynomialalgorithmbasedonthedynamicprogrammingtechniquetosolvethesequestions.Additionally,italsooutputssuchatreeclustering,iftheanswerispositive.AconsequenceofourresultsisthattheproblemwhetherornotagivengraphisatreeoftrianglesisinP.Thiscontraststhefactthattheproblem
Skodinis NP-Completeness of some tree-clustering problems. Graph Drawing `98, LNCS 1547 Abstract A graph is a tree of paths (cycles), if its vertex...
20页 免费 Skodinis NP-Completeness... 暂无评价 14页 免费搜你所想,读你... Practical Parallel Algorithms for Some Tree and Graph Problems byby隐藏>> ...
Skodinis NP-Completeness... 暂无评价 14页 免费...更多>>Graph clustering is the problem of ...We prove that the decision problems associated ...
Skodinis NP-Completene... 暂无评价 14页 免费 ...On #P-completeness of Some Counting Problems ... let x 2 be an encoding of the graph G = ...
Skodinis NP-Completeness... 暂无评价 14页 免费...更多>>Graph clustering is the problem of ...We prove that the decision problems associated ...
热门文档