Sciweavers

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

78

SOFSEM
2010
Springer

104views Theoretical Computer Science» more SOFSEM 2010»

On Contracting Graphs to Fixed Pattern Graphs

15 years 12 months ago

On Contracting Graphs to Fixed Pattern Graphs

Download www.dur.ac.uk

Pim van 't Hof, Marcin Kaminski, Daniël Paulu

Real-time Traffic

SOFSEM 2010 | Theoretical Computer Science |

claim paper

Related Content

» Choosability of toroidal graphs without short cycles

» GrouseFlocks Steerable Exploration of Graph Hierarchy Space

» Texture Segmentation by Contractive Decomposition and Planar Grouping

» Mining faulttolerant frequent patterns efficiently with powerful pruning

» Constructing Stochastic Pyramids by MIDES Maximal Independent Directed Edge Set

» The complexity of choosing an Hcolouring nearly uniformly at random

» Test Data Compression Using Dictionaries with FixedLength Indices

» Querying Graphs in ProteinProtein Interactions Networks Using Feedback Vertex Set

» Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth

Post Info
More Details (n/a)

Added	17 Mar 2010
Updated	17 Mar 2010
Type	Conference
Year	2010
Where	SOFSEM
Authors	Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Comments (0)