소장자료
LDR | 03294cam a2200000 a | ||
001 | 0100727663▲ | ||
005 | 20231025140810▲ | ||
007 | ta ▲ | ||
008 | 210414s2022 njua b 001 0 eng c▲ | ||
010 | ▼a 2021010555▲ | ||
020 | ▼a9781118937181▼q(hbk.)▲ | ||
020 | ▼z9781118937204▼q(adobe pdf)▲ | ||
020 | ▼z9781118937273▼q(epub)▲ | ||
035 | ▼a(KERIS)REF000019558189▲ | ||
040 | ▼aLBSOR/DLC▼beng▼cDLC▼d221016▲ | ||
042 | ▼apcc▲ | ||
050 | 0 | 0 | ▼aQA166▼b.K545 2021▲ |
082 | 0 | 4 | ▼a511/.5▼223▲ |
090 | ▼a511.5▼bK54g▲ | ||
100 | 1 | ▼aKingan, Sandra,▼d1966-▲ | |
245 | 1 | 0 | ▼aGraphs and networks /▼cSandra Kingan.▲ |
260 | 1 | ▼aHoboken, NJ :▼bWiley,▼c2021.▲ | |
300 | ▼axvii, 263 p.:▼bill. ;▼c24 cm.▲ | ||
504 | ▼aIncludes bibliographical references (p. 237-251) and index.▲ | ||
505 | 0 | ▼aFrom Königsberg to connectomes -- Fundamental topics -- Similarity and centrality -- Types of networks -- Graph algorithms -- Structure, coloring, higher connectivity -- Planar graphs -- Flows and matchings.▲ | |
520 | ▼a"Network science is applied graph theory, and this book successfully blends essential graph theory topics with practical and relevant network science to illustrate the underlying mathematics. Mathematicians have been relegated to small-time players in a field populated with sociologists, computer scientists, and physicists. On the other hand, graph theory books are written like reference manuals jam-packed with theorems for graph theorists, leading instructors of graph theory courses to tease out their lectures from a plethora of results. This book's combination of theory and modern applications is needed by both practitioners of data science and students of graph theory seeking to learn modern applications. For example, one difference between this book and existing network science books is that network scientists title their chapters based on individual large graphs such as epidemic graphs or web graphs and study all its properties. However, large graphs have a lot of features in common so this book distills those common elements, presents the concepts behind the large graphs, and presents particular large graphs as examples of the underlying mathematics. With a focus on topics most relevant to network science, such as graph structural theory, link analysis, and spectral graph theory, this book contains a host of untapped results for network scientists. In addition, the book is supplemented with a related website and an Instructor's Manual. Topical coverage includes: basic definitions; isomorphism; graph substructures; graph operations; graph statistics; tress; degree sequences; Eulerian circuits; Hamiltonian cycles; planar graphs; colorings; matchings and coverings; graph algorithms; network algorithms; random graphs; spectral graph theory; centrality measures; network flows; network reliability; extremal graph theory; higher connectivity; excluded minors; Tutte's wheels theorem; splitter theorem; and k-sums and decomposition"--▼cProvided by publisher.▲ | ||
650 | 0 | ▼aGraph theory.▲ | |
650 | 0 | ▼aSystem analysis.▲ | |
900 | 1 | ▼aS. R. Kingan.▲ |
Graphs and networks
자료유형
국외단행본
서명/책임사항
Graphs and networks / Sandra Kingan.
발행사항
Hoboken, NJ : Wiley , 2021.
형태사항
xvii, 263 p. : ill. ; 24 cm.
서지주기
Includes bibliographical references (p. 237-251) and index.
내용주기
From Königsberg to connectomes -- Fundamental topics -- Similarity and centrality -- Types of networks -- Graph algorithms -- Structure, coloring, higher connectivity -- Planar graphs -- Flows and matchings.
요약주기
"Network science is applied graph theory, and this book successfully blends essential graph theory topics with practical and relevant network science to illustrate the underlying mathematics. Mathematicians have been relegated to small-time players in a field populated with sociologists, computer scientists, and physicists. On the other hand, graph theory books are written like reference manuals jam-packed with theorems for graph theorists, leading instructors of graph theory courses to tease out their lectures from a plethora of results. This book's combination of theory and modern applications is needed by both practitioners of data science and students of graph theory seeking to learn modern applications. For example, one difference between this book and existing network science books is that network scientists title their chapters based on individual large graphs such as epidemic graphs or web graphs and study all its properties. However, large graphs have a lot of features in common so this book distills those common elements, presents the concepts behind the large graphs, and presents particular large graphs as examples of the underlying mathematics. With a focus on topics most relevant to network science, such as graph structural theory, link analysis, and spectral graph theory, this book contains a host of untapped results for network scientists. In addition, the book is supplemented with a related website and an Instructor's Manual. Topical coverage includes: basic definitions; isomorphism; graph substructures; graph operations; graph statistics; tress; degree sequences; Eulerian circuits; Hamiltonian cycles; planar graphs; colorings; matchings and coverings; graph algorithms; network algorithms; random graphs; spectral graph theory; centrality measures; network flows; network reliability; extremal graph theory; higher connectivity; excluded minors; Tutte's wheels theorem; splitter theorem; and k-sums and decomposition"-- Provided by publisher.
ISBN
9781118937181
청구기호
511.5 K54g
소장정보
예도서예약
서서가에없는책 신고
보보존서고신청
캠캠퍼스대출
우우선정리신청
배자료배달신청
문문자발송
출청구기호출력
학소장학술지 원문서비스
등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 서비스 |
---|
북토크
자유롭게 책을 읽고
느낀점을 적어주세요
글쓰기
느낀점을 적어주세요
청구기호 브라우징
관련 인기대출 도서