<--- 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

Rigidity, connectivity and graph decompositions The PappusAn AutopolarA Self-polar hexagon Fragments

DocID: 1v3Ej - View Document

A 1.8 Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 GUY EVEN Tel-Aviv University JON FELDMAN Google, NY

DocID: 1u559 - View Document

Graph theory: connectivity Po-Shen Loh 24 June

DocID: 1tQBp - View Document

Shattering, Graph Orientations, and Connectivity

DocID: 1tBeq - View Document

Graph Connectivity Measures for Unsupervised Word Sense Disambiguation Roberto Navigli Dipartimento di Informatica Universit`a di Roma “La Sapienza” Abstract

DocID: 1tlT1 - View Document