mathematics.waw.pl - Mathematics - A polynomial algorithm for maximum vertex packings on graphs without long odd cycles (Technical report - School of Operations Research and Industrial

» Mathematics » Letter A » A polynomial algorithm for maximum vertex packings

A polynomial algorithm for maximum vertex packings on graphs without long odd cycles (Technical report - School of Operations Research and Industrial by Wen-lian Hsu

BUY FROM AMAZON

Today only $0

>>

Buy book

Recommended books:

A new approach to the maximum flow problem (Technical report. Princeton University. Department of Computer Science) - Andrew V Goldberg

Small transversals in hypergraphs (Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research) - V Chvátal

Voronoi diagrams on the surface of a polyhedron (Computer science technical report series. University of Maryland) - David M Mount

Two papers on graph embedding problems (CMU-CS-80-102) - James B Saxe

A note on perfect orders (Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research) - C. T Hoang

Chromatic number approximation using simulated annealing (Tech report) - Craig A Morgenstern

Separation pair detection (Technical report. University of Texas at Austin. Dept. of Computer Sciences) - Donald Fussell

Acceleration of parallel computations of the minimum cost paths in an undirected graph having a small separator family (Technical report. State Univer - Victor Pan

Characterizing structural descriptions produced by various grammatical formalisms (Technical report. University of Pennsylvania. School of Engineering - K Vijay-Shanker

Synchronization using counting semaphores (Research report RC. International Business Machines Corporation. Research Division) - Vivek Sarkar

sklep - gry logiczne - gry mario - Skutery Skutery Skutery - nauka jazdy opole - gry wojenne - znajdź różnice - gry kolorowanki - gry ekonomiczne - ubieranki

heatheness
p
q
t
b