Graphs : theory and algorithms / by Olga Moreira.

By:

Moreira, Olga [editor]

Material type:

Computer fileLanguage: English Publication details: Burlington, Canada : Arcler Press, 2021Description: 1 online resource (xxiii, 394, pages) : color illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781774077016 (e-book)

Subject(s):

LOC classification:

QA166 G76 2021

Online resources:

Contents:

1. Introduction -- 2. An image encryption algorithm based on random hamiltonian path -- 3. Traveling in networks with blinking nodes -- 4. On minimum spanning subgraphs of graphs with proper connection number 2 -- 5. New algorithm for calculating chromatic index of graphs and its applications -- 6. An edge-swap heuristic for finding dense spanning trees -- 7. Identifying network structure similarity using spectral graph theory -- 8.On generalized distance gaussian estrada index of graphs -- 9. Nullity and energy bounds of central graph of smith graphs -- 10.Induced subgraph saturated graphs -- 11. Connection and separation in hyper graphs -- 12. Vertex rough graphs -- 13. Incremental graph pattern matching algorithm for big graph data -- 14. Framework and algorithms for identifying honest blocks in block chain -- 15. Enabling controlling complex networks with local topological information -- 16. Estimation of traffic flow changes using networks in networks approaches -- 17. Hidden geometries in networks arising from cooperative self-assembly -- 18. Using graph theory to assess the interaction between cerebral function, brain hemodynamics, and systemic variables in premature infants

Summary: The book "Graphs:Theory and Algorithm" is a collection of modern articles features several graph-based methods and algorithms. It also covers important theoretical aspects pertaining to matrix representations of graphs such as the Laplacian and distance matrices which can be used for solving problems such that of the Hamiltonian and shortest path, as well as in finding minimum spanning trees and matching patterns.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 5 )

Holdings
Item type	Current library	Collection	Call number	Materials specified	Status	Notes	Date due	Barcode
Online E-Books	Ladislao N. Diwa Memorial Library Multimedia Section	Non-fiction	OEBP QA166 G76 2021 (Browse shelf(Opens below))		Available	PAV		OEBP000248
Compact Discs	Ladislao N. Diwa Memorial Library Multimedia Section	Non-fiction	EB QA166 G76 2021 (Browse shelf(Opens below))		Room use only	PAV		EB000248

Browsing Ladislao N. Diwa Memorial Library shelves, Shelving location: Multimedia Section, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous								Next
Previous	OEBP P96 E57G17 2021 Media and water : communication, culture and perception /	OEBP QA16 A53Aw7 2020 Awesome math : teaching mathematics with problem-based learning /	OEBP QA164 C73 2021 Computer science, algorithms and complexity /	OEBP QA166 G76 2021 Graphs : theory and algorithms /	OEBP QA20 Y2 2020 Introduction to mathematical literacy /	OEBP QA297 D35 2020 Numerical methods in science and engineering : theories with MATLAB, mathematica, fortran, C and python programs /	OEBP QC21 M72 2020 Modern physics /	Next

https://portal.igpublish.com/iglibrary/ is required to read this e-book.

Include bibliographical references and index

1. Introduction -- 2. An image encryption algorithm based on random hamiltonian path -- 3. Traveling in networks with blinking nodes -- 4. On minimum spanning subgraphs of graphs with proper connection number 2 -- 5. New algorithm for calculating chromatic index of graphs and its applications -- 6. An edge-swap heuristic for finding dense spanning trees -- 7. Identifying network structure similarity using spectral graph theory -- 8.On generalized distance gaussian estrada index of graphs -- 9. Nullity and energy bounds of central graph of smith graphs -- 10.Induced subgraph saturated graphs -- 11. Connection and separation in hyper graphs -- 12. Vertex rough graphs -- 13. Incremental graph pattern matching algorithm for big graph data -- 14. Framework and algorithms for identifying honest blocks in block chain --
15. Enabling controlling complex networks with local topological information -- 16. Estimation of traffic flow changes using networks in networks approaches -- 17. Hidden geometries in networks arising from cooperative self-assembly -- 18. Using graph theory to assess the interaction between cerebral function, brain hemodynamics, and systemic variables in premature infants

The book "Graphs:Theory and Algorithm" is a collection of modern articles features several graph-based methods and algorithms. It also covers important theoretical aspects pertaining to matrix representations of graphs such as the Laplacian and distance matrices which can be used for solving problems such that of the Hamiltonian and shortest path, as well as in finding minimum spanning trees and matching patterns.

Fund 164 CE-Logic Purchased April 14, 2022 OEBP000248 P. Roderno PHP 19,376.20
2022-04-230 0000