Graph algorithms and applications.

QR Kod

Graph algorithms and applications. t.I /

Kaydedildi:

Detaylı Bibliyografya
Diğer Yazarlar:	Tamassia, Roberto, 1960-, Tollis, Ioannis G., 1958-
Materyal Türü:	Sách giấy
Baskı/Yayın Bilgisi:	River Edge, N.J. : World Scientific, c2002.
Konular:	Graph algorithms.
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

Benzer Materyaller

Graphs, Algorithms, and Optimization
Yazar:: Kocay, William
Baskı/Yayın Bilgisi: (2005)

Graphs, algorithms, and optimization /
Yazar:: Kocay, William.
Baskı/Yayın Bilgisi: (2005)

Graphs, algorithms, and optimization /
Yazar:: Kocay, William.
Baskı/Yayın Bilgisi: (2005)

Graphs, algorithms, and optimization /
Yazar:: Kocay, William.
Baskı/Yayın Bilgisi: (2005)

Algorithmic graph theory
Yazar:: Alan Gibbons
Baskı/Yayın Bilgisi: (1985)

The bidimensionality theory and its algorithmic applications /
Yazar:: Demaine, Erik D.

Parallel algorithms for graph problems /
Yazar:: Metaxas, Panatiotis.
Baskı/Yayın Bilgisi: (2000)

Fast parallel algorithms for graph matching problems /
Yazar:: Karpinski, Marek, 1948-
Baskı/Yayın Bilgisi: (1998)

Algorithmic graph theory and perfect graphs
Yazar:: Golumbic, Martin Charles
Baskı/Yayın Bilgisi: (2004)

Applied and algorithmic graph theory
Yazar:: Gary Chartrand
Baskı/Yayın Bilgisi: (1993)

Applied and algorithmic graph theory /
Yazar:: Chartrand, Gary.
Baskı/Yayın Bilgisi: (1993)

Graph theory and its applications /
Yazar:: Gross, Jonathan L.
Baskı/Yayın Bilgisi: (1999)

Planarity of joined graphs /
Yazar:: Sitthiwiratham, T.

Shannon graphs, subshifts and lambda-graph systems /
Yazar:: Krieger, Wolfgang.

4-Regular graph of diameter 2 /
Yazar:: Do Nhu An.

4-Regular graph of diameter 2
Yazar:: Đỗ, Như An, ve diğerleri
Baskı/Yayın Bilgisi: (2012)

CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
Yazar:: Do, Nhu An, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Graph theory
Yazar:: W. T. Tutte
Baskı/Yayın Bilgisi: (2001)

Graph theory
Yazar:: Diestel, Reinhard
Baskı/Yayın Bilgisi: (2005)

Graph theory /
Yazar:: Diestel, Reinhard.
Baskı/Yayın Bilgisi: (2000)

4-regular graph of diameter 2
Yazar:: Do, Nhu An, ve diğerleri
Baskı/Yayın Bilgisi: (2014)

Introduction to graph theory
Yazar:: Richard J Trudeau
Baskı/Yayın Bilgisi: (1993)

Introduction to graph theory
Yazar:: Robin J Wilson
Baskı/Yayın Bilgisi: (1996)

Algebraic graph theory /
Yazar:: Godsil, C. D. 1949-
Baskı/Yayın Bilgisi: (2001)

Fuzzy Graph Theory with Applications to Human Trafficking
Yazar:: Mordeson, John N., ve diğerleri
Baskı/Yayın Bilgisi: (2020)

Graph connections : relationships between graph theory and other areas of mathematics /
Baskı/Yayın Bilgisi: (1997)

Graph connections : relationships between graph theory and other areas of mathematics /
Baskı/Yayın Bilgisi: (1997)

Degree prime graph /
Yazar:: Sattanathan, M.

Types de données et algorithmes; T2: recherche, tri, algorithmes sur les graphes
Yazar:: Marie Claude Gaudel

Graph theory and its engineering applications /
Yazar:: Chen, Wai-Kai, 1936-
Baskı/Yayın Bilgisi: (1997)

Schaum's outline of theory and problems of graph theory
Yazar:: V. K. Balakrishnan
Baskı/Yayın Bilgisi: (1997)

On Sets and Graphs. 1st ed. 2017
Yazar:: Omodeo, Eugenio G., ve diğerleri
Baskı/Yayın Bilgisi: (2020)

Graph theory and statistics
Baskı/Yayın Bilgisi: (2003)

Graph matching-based distributed clustering and backbone formation algorithms for sensor networks /
Yazar:: Dagdeviren, Orhan.

Some Applications of Euler Graph
Yazar:: Ho, Thi Hong Lien
Baskı/Yayın Bilgisi: (2025)

Generalized T-pebbling number of a graph /
Yazar:: Lourdusamy, A.

Drawing graphs : methods and models /
Baskı/Yayın Bilgisi: (2001)

Combinatorics and graph theory /
Yazar:: Harris, John M. 1969-
Baskı/Yayın Bilgisi: (2000)

Gracefulness of union of cycle with parallel chords and complete bipartite graphs or paths /
Yazar:: Elumalai, A.

Innovative computational methods for transcriptomic data analysis : a case study in the use of FPT for practical algorithm design and implementation /