Graph theory with applications to algorithms and computer science
著者
書誌事項
Graph theory with applications to algorithms and computer science
Wiley, c1985
大学図書館所蔵 件 / 全58件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Other editors: G. Chartrand, L. Lesniak, D.R. Lick, C.E. Wall
"Proceedings of the Fifth Quadrennial International Conference on the Theory and Applications of Graphs with special emphasis on Algorithms and Computer Science Applications, held at Western Michigan University in Kalamazoo, June 4-8, 1984"--Pref
"A Wiley-Interscience publication."
Includes bibliographical references and index
内容説明・目次
内容説明
An applications-orientated text detailing the latest research in graph theory and computer science. Leading contributors cover such important topics as: tiling problems and graph factors; partioning the nodes of a graph; diameter vulnerability in networks; edge-disjoint Hamiltonian cycles; the cochromatic number of graphs in a switching sequence; and more.
目次
Partial table of contents: Finite Figures Consisting Of Regular Polygons (J. Akiyama, et al.). Eigenvalues, Geometric Expanders and Sorting in Rounds (N. Alon). Long Path Enumeration Algorithms for Timing Verification on Large Digital Systems (T. Asano and S. Sato). On Upsets in Bipartite Tournaments (K. Bagga). Some Results on Binary Matrices Obtained via Bipartite Tournaments (K. Bagga and L. Beineke). Partitioning the Nodes of a Graph (E. Barnes). A Graph Theoretical Characterization of Minimal Deadlocks in Petri Nets (J. Bermond and G. Memmi). On Graceful Directed Graphs that Are Computational Models of Some Algebraic Systems (G. Bloom and D. Hsu). The Cut Frequency Vector (F. Boesch). Diameter Vulnerability in Networks (J. Bond and C. Peyrat). Generalized Colorings of Outerplanar and Planar Graphs (I. Broere and C. Mynhardt). The Ramsey Number for the Pair Complete Bipartite Graph-Graph of Limited Degree (S. Burr, et al.). Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (F. Chung). Hamilton Cycles and Quotients of Bipartite Graphs (I. Dejter). Problems and Results on Chromatic Numbers in Finite and Infinite Graphs (P. Erdos). Supraconvergence and Functions that Sum to Zero on Cycles (V. Faber and A. White, Jr.). Edge-Disjoint Hamiltonian Cycles (R. Faudree, et al.). Studies Related to the Ramsey Number r(K d5 u - e) (R. Faudree, et al). The Structural Complexity of Flowgraphs (N. Fenton). n-Domination in Graphs (J. Fink and M. Jacobson).
「Nielsen BookData」 より