Sciweavers

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

15

WG
2004
Springer

favoriteEmaildiscussreport

141views Theoretical Computer Science» more WG 2004»

Finding k Disjoint Triangles in an Arbitrary Graph

13 years 10 months ago

Finding k Disjoint Triangles in an Arbitrary Graph

Download bora.uib.no

We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a ﬁxed graph H. For H = K3

Mike Fellows, Pinar Heggernes, Frances A. Rosamond

Real-time Traffic

Computer Science | Input Graph | NP-complete Problem | WG 2004 |

claim paper

Related Content

» Packing Edge Disjoint Triangles A Parameterized View

» Efficient Algorithms for k Disjoint Paths Problems on DAGs

» Addressing Network Survivability Issues by Finding the KBest Paths through a Trellis Graph

» Countable connectedhomogeneous graphs

» Finding minimizing and counting weighted subgraphs

» Finding Folkman Numbers via MAX CUT Problem

» Polar cographs

» Algorithmic Aspects of Minimum Energy EdgeDisjoint Paths in Wireless Networks

» Symmetric range assignment with disjoint MST constraints

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Comments (0)