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
292FalkSchreiberandKonstantinos



Skodinis
:C
(a)(b)(c) anditsdi erentpathclusteringsFigure2.GraphC
notformatreebecausetheyarepairwiseconnectedbyedgesfromG.Hence,P3andP2areidenticalinTandlbelongstoP2.Forsymmetrythesameholdsforvertexr.
Theorem1.TheToPproblemisNP-complete.
Proof.ObviouslytheToPproblemisinNP.WeshowthatitisNP-hard.Theproofisareductionfromther-ONE-IN-THREE3SATproblem.LetφbeaninstancewithnclausesC1,...,Cn.WeconstructagraphG(φ)andweshowthatφissatis ableifandonlyifG(φ)isatreeofpaths. ofFigure2.WecreatencopiesThekeytoourconstructionisthegraphC nofC sidebyside,oneforeveryclauseCi.Forconveniencewewill 1,...,CC ibyxi,yi,zi,li,ri,respectively.Ver-denotethecopiesofverticesx,y,z,l,rinCticesxi,yiandzicorrespondtotheliteralsoftheclauseCi.Wecreateanewvertexbandconnectitwithallverticesliandri.Thenweaddanedgebetweenverticesriandli+1,1≤i≤n 1.Finally,weaddanedgebetweentwover-ticesindi erentcopiesifandonlyiftheverticescorrespondtooppositeliterals.Figure3illustratestheconstruction.
Weclaimthatφissatis ableifandonlyifG(φ)isatreeofpaths.Inproof,supposethatthereisatruthassignmentsatisfyingφ.Thus,everyclausehas itheverticescorrespondingtotwofalseandonetrueliteral.IneverycopyCthefalseliteralsareapathinG(φ),denotedbyPi.TheverticesliandriandtheverticescorrespondingtothetrueliteralsintheclausesarealsoapathinG(φ),denotedbyP.Finally,thevertexbisatriviallysinglepathdenotedbyP .ByconstructionP isconnectedwithPwhichitselfisconnectedwitheveryPi.Sincethereisnoconnectionbetweentwodi erentpathsPiandPj(twofalseliteralscanneverbeoppositeandthusneverbeadjacent),P1,...,Pn,P,andP formatreeclusteringofG(φ).
Conversely,supposethatG(φ)isatreeofpathswhithatreeclusteringT.Ouraimistode neatruthassignmentforφ.First,takeacloserlookatthestructureofG(φ)toexploresomeimportantinformationaboutitsclusteringT.
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 ...
热门文档