<--- Back to Details
First PageDocument Content
NP-complete problems / Graph coloring / Combinatorics / Clique / Line graph / Factorial / Naor-Reingold Pseudorandom Function / Trapezoid graph / Graph theory / Mathematics / Theoretical computer science
Date: 2006-11-05 15:16:07
NP-complete problems
Graph coloring
Combinatorics
Clique
Line graph
Factorial
Naor-Reingold Pseudorandom Function
Trapezoid graph
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: ftp.math-inst.hu

Download Document from Source Website

File Size: 994,69 KB

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