<--- Back to Details
First PageDocument Content
NP-complete problems / Clique / Neighbourhood / Line graph / Adjacency matrix / Graph / Tree / Independent set / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science
Date: 2010-09-27 09:57:50
NP-complete problems
Clique
Neighbourhood
Line graph
Adjacency matrix
Graph
Tree
Independent set
Planar separator theorem
Graph theory
Mathematics
Theoretical computer science

doi:[removed]j.cosrev[removed]

Add to Reading List

Source URL: geza.kzoo.edu

Download Document from Source Website

File Size: 1,95 MB

Share Document on Facebook

Similar Documents

On-line Hierarchical Graph Drawing Stephen C. North and Gordon Woodhull north, AT&T Labs - Research 180 Park Ave. Bldg. 103 Florham Park, New JerseyU.S.A.)

DocID: 1vbCS - View Document

Line Graph When you have something that is measurable and scalable on the x and y-axis. Example – plant height vs. fertilizer amount. Fertilizer amount might go on the x-axis and plant height would go on the y-axis. B

DocID: 1v0CD - View Document

Interactive activity – Lines and bars graph www.webardora.net Activity where we can create a line or a bar graph and also perform several operations on the same data table, etc:

DocID: 1uVcL - View Document

Florian LEHNER The Line Graph of Every Locally Finite 6-Edge-Connected Graph with Finitely Many Ends is Hamiltonian MASTER THESIS

DocID: 1uzeW - View Document

Problem E1. The magnetic permeability of water is essentially unperturbed; connecting the respective points on the graph, we obtain a line corresponding to a flat water sur(10 points) Part A. Qualitative shape of the wat

DocID: 1uaqE - View Document