Sciweavers

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

8

CPM
2009
Springer

favoriteEmaildiscussreport

93views Combinatorics» more CPM 2009»

Maximum Motif Problem in Vertex-Colored Graphs

13 years 11 months ago

Maximum Motif Problem in Vertex-Colored Graphs

Download www.cs.ucr.edu

Riccardo Dondi, Guillaume Fertin, Stéphane

Real-time Traffic

CPM 2009 | Discrete Geometry |

claim paper

Related Content

» Sharp Tractability Borderlines for Finding Connected Motifs in VertexColored Graphs

» Deterministic distributed vertex coloring in polylogarithmic time

» Incremental List Coloring of Graphs Parameterized by Conservation

» Approximation algorithms for finding and partitioning unitdisk graphs into cokplexes

» Modular decomposition and transitive orientation

» Coloring unstructured wireless multihop networks

» On the Kernelization Complexity of Colorful Motifs

» Weak graph colorings distributed algorithms and applications

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CPM
Authors	Riccardo Dondi, Guillaume Fertin, Stéphane Vialette

Comments (0)