<--- Back to Details
First PageDocument Content
NP-complete problems / Vertex cover / Approximation algorithm / Cubic graph / Feedback arc set / Dominating set / Graph theory / Theoretical computer science / Mathematics
Date: 2012-09-17 05:11:28
NP-complete problems
Vertex cover
Approximation algorithm
Cubic graph
Feedback arc set
Dominating set
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: fpt.wdfiles.com

Download Document from Source Website

File Size: 226,79 KB

Share Document on Facebook

Similar Documents

Graph theory / NP-complete problems / Extremal graph theory / Line graph / Cubic graph / Graph / Cycle / Regular graph / Hamiltonian path

DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978

DocID: 1qndD - View Document

Crystallography / Lattice / Diamond cubic / Laves graph / Space group / Covering graph / Toshikazu Sunada / Crystal structure / Random walk / Dipole graph / Periodic graph

Crystals That Nature Might Miss Creating Toshikazu Sunada N

DocID: 1pJ36 - View Document

Graph coloring / NP-complete problems / Bipartite graph / Parity / Graph theory / Treewidth / Vertex cover / Cubic graph / Cograph / Hadwiger number

Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

DocID: 1pIgc - View Document

Graph theory / Combinatorial optimization / NP-complete problems / Matching / Maximum cut / Clique / Graph / Cubic graph / Degree / Cut / Directed graph / Line graph

MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat

DocID: 1onhg - View Document

EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. This

DocID: 1lp9s - View Document