Back to Results
First PageMeta Content
Graph coloring / NP-complete problems / Graph theory / Parameterized complexity / NP-complete / Theoretical computer science / Mathematics / Applied mathematics


Maximum Motif Problem in Vertex-Colored Graphs
Add to Reading List

Document Date: 2009-06-21 01:15:30


Open Document

File Size: 739,35 KB

Share Result on Facebook
UPDATE