Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
WG
2004
Springer
favorite
Email
discuss
report
141
views
Theoretical Computer Science
»
more
WG 2004
»
Finding k Disjoint Triangles in an Arbitrary Graph
14 years 1 months ago
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 fixed 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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision