<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Graph connectivity / Graph operations / Graph coloring / Degeneracy / Tree / Neighbourhood / Clique / K-edge-connected graph / Vertex cover / Degree
Date: 2014-10-07 11:22:31
Graph theory
NP-complete problems
Graph connectivity
Graph operations
Graph coloring
Degeneracy
Tree
Neighbourhood
Clique
K-edge-connected graph
Vertex cover
Degree

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Download Document from Source Website

File Size: 401,43 KB

Share Document on Facebook

Similar Documents

Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017

Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017

DocID: 1xVZc - View Document

SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration

SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration

DocID: 1xVIR - View Document

Testimonial Green Tree Implements Simple, Impactful Safety Program with WorkSafe Website: greentreehc.com As a home care agency owner I had limited options for workers’

Testimonial Green Tree Implements Simple, Impactful Safety Program with WorkSafe Website: greentreehc.com As a home care agency owner I had limited options for workers’

DocID: 1xV42 - View Document

arXiv:1802.00921v1 [cs.SE] 3 FebA deep tree-based model for software defect prediction Hoa Khanh Dam  Trang Pham

arXiv:1802.00921v1 [cs.SE] 3 FebA deep tree-based model for software defect prediction Hoa Khanh Dam Trang Pham

DocID: 1xV1q - View Document