文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Skodinis NP-Completeness of some tree-clustering problems. Graph Drawing `98, LNCS 1547
侵权投诉

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 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 .

上一页第3页

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email