<--- Back to Details
First PageDocument Content
Network flow / Dominating set / Graph / Flow network / Connectivity / Topology / Tree decomposition / Centrality / Graph theory / Mathematics / Theoretical computer science
Date: 2010-07-19 10:46:14
Network flow
Dominating set
Graph
Flow network
Connectivity
Topology
Tree decomposition
Centrality
Graph theory
Mathematics
Theoretical computer science

C:/Documents and Settings/Arik Motskin/Desktop/CCCG/cds_cccg_paper.dvi

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 132,91 KB

Share Document on Facebook

Similar Documents

Theoretical Computer Science–40  www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view

Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view

DocID: 1xVR3 - View Document

Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗

Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗

DocID: 1xUAX - View Document

Theoretical Computer Science–24  Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs

Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs

DocID: 1xUr4 - View Document

Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen

Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen

DocID: 1xTuz - View Document

CS 153  Current Topics in Theoretical Computer Science Spring 2016

CS 153 Current Topics in Theoretical Computer Science Spring 2016

DocID: 1vryF - View Document