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
290FalkSchreiberandKonstantinosSkodinis
whetherornotagivengraphcanbepartitionedintotrianglesisNP-complete,seeGT11in[9].
2BasicNotions
Inthissectionwereviewsomebasicnotionsongraphsandestablishournotation.AgraphwithvertexsetVandedgesetEwillbedenotedbyG=(V,E).ThecardinalityofthevertexsetwillbecalledthesizeofG.Wedealwithundirectedgraphswithoutloopsandmultipleedges.ThesubgraphofagraphGinducedbyavertexsetUisdenotedbyG[U].AvertexsetSisaseparatorofGifgraphG[V S]isdisconnected.ApathoflengthnisagraphwithvertexsetV={v1,...,vn}andedgesetE={(vi,vi+1)|1≤i≤n 1}.Similarly,acycleoflengthnisagraphwithvertexsetV={v1,...,vn}withn≥3,andedgesetE={(vi,vi+1)|1≤i≤n 1}∪{(vn,v1)}.Forconvenience,wealsosaythatasubsetP Visapath(cycle)inG,ifthesubgraphG[P]isapath(cycle).FurtheraseparatorSisapath(cycle)separatorifSisapath(cycle).Nextwede netwo-levelclusteredgraphs.Inordertodothiswe rstde neforagraphG=(V,E)itsclusteringwithrespecttoapartitionofV.De nition1.LetG=(V,E)beagraphandV1,...,Vma(nonempty)parti-tionofthevertexsetV.Thegraphwithvertexset{w1,...,wm}andedgeset{(wi,wj)|u∈Vi,u ∈Vj,i=j,and(u,u )∈E}iscalledtheclusteringofGwithrespecttothepartitionV1,...,Vm.
Intuitively,theclusteringofGisconstructedfromGby rstshrinkingeverysubgraphG[Vi]intoasinglevertexwiandthenmergingmultipleedges.
De nition2.LetG=(V,E)beagraphandXandYtwographclasses.GraphGisanX-graphofY-graphs(XofYgraph),ifthereisapartitionV1,...,VmofthevertexsetV,suchthat
1.thesubgraphsG[V1],...,G[Vm]arefromtheclassY,and
2.theclusteringofGwithrespecttothepartitionV1,...,VmisfromtheclassX.
Inthispaperwerestrictourselvestotreeofpathsandtreeofcycles.EverysuchgraphGhasatreeclusteringT.ForreasonsofreadabilitywedistinguishbetweennodesofTandverticesofG.EverynodeofTrepresentsapath(cycle)inG.Wewillidentifyanodeanditsrepresentingpath(cycle)inG.AbranchofTatwisthemaximalsubtreeofTcontainingwandexactlyoneneighbourofwinT.NoticethatthenumberofbranchesofTatwequalsthedegreeofwinT.Ifthepaths(cycles)ofatreeclusteringThavemaximallengthkthenTwillbedenotedbyTk.
Asexamplesnoticethefollowingfacts:Obviously,everytreeisatreeofpaths,andevery2n×2n-gridisatree(path)ofcycles.Tothecontraryeverycliquewithmorethan6verticesisneitheratreeofpathsnoratreeofcycles.Furthermore,everycycleoflengthnisatree(path)ofpaths,butithasnotreeclusteringTkofpathswithk< n/2 .
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 ...
热门文档