<--- Back to Details
First PageDocument Content
Combinatorial optimization / Graph / Tree decomposition / Max-flow min-cut theorem / Planar graphs / Tree / Topology / Dynamic programming / Connectivity / Graph theory / Mathematics / Graph operations
Date: 2006-01-12 14:44:14
Combinatorial optimization
Graph
Tree decomposition
Max-flow min-cut theorem
Planar graphs
Tree
Topology
Dynamic programming
Connectivity
Graph theory
Mathematics
Graph operations

Add to Reading List

Source URL: akpublic.research.att.com

Download Document from Source Website

Share Document on Facebook

Similar Documents

Artificial intelligence / Applied mathematics / Learning / Machine learning / Computational neuroscience / Artificial neural networks / Computational statistics / Monte Carlo tree search / Convolutional neural network / Reinforcement learning / Q-learning / Structured prediction

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

Multiplexing / T-carrier / Schedule

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

DocID: 1xVIR - View Document

Health / Caregiving / Worksafe / Home care / Insurance / Caregiver

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

DocID: 1xV1q - View Document