Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DM
2008

favoriteEmaildiscussreport

83views more DM 2008»

Highly connected multicoloured subgraphs of multicoloured graphs

13 years 4 months ago

Highly connected multicoloured subgraphs of multicoloured graphs

Download www.math.uiuc.edu

We consider the following question of Bollob

Henry Liu, Robert Morris, Noah Prince

Real-time Traffic

DM 2008 | K-connected Subgraph | Partial Solution | R-colouring |

claim paper

Related Content

» Finding maximal kedgeconnected subgraphs from a large graph

» Forcing highly connected subgraphs

» The expansion and mixing time of skip graphs with applications

» Towards proximity pattern mining in large graphs

» Software and Algorithms for Graph Queries on Multithreaded Architectures

» Messageoptimal connected dominating sets in mobile ad hoc networks

» A Memetic Algorithm for the Generalized Minimum VertexBiconnected Network Problem

» Degree Bounded Network Design with Metric Costs

» Efficient processing of grouporiented connection queries in a large graph

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Henry Liu, Robert Morris, Noah Prince

Comments (0)