 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Contents
Other editions - View all
Common terms and phrasesacyclic adjacent algorithm augmenting path back edge bipartite graph circuit of G circuit subspace cocircuit coloring computing connected graph Consider construct contains Corollary corresponding defined denote directed circuits directed graph directed path directed s-t path dual edge set edge-disjoint edge-induced subgraph edges incident edges of G electrical network elements end vertices equal Eulerian graph exists following theorem fundamental circuit fundamental cutset graph G graph of Fig graph theory Hence in-degree incidence matrix independent set induced subgraph labeling layered network Lemma length Let G matroid maximal maximum flow maximum matching n-vertex nonzero number of edges number of vertices paths in G planar graph problem Proof prove push result ring sum saturated self-loops shortest paths shown in Fig simple graph spanning tree strongly connected strongly connected component subgraph of G submatrix subset Suppose transitive closure transport network tree of G undirected vector space vertex set vertices of G weight spanning tree References to this bookFrom Google ScholarLandscape Connectivity: A Graph-theoretic PerspectiveDean Urban, Timothy Keitt - 2001 - Ecology Planarizing Graphs—A Survey and Annotated BibliographyAnnegret Liebers Power Transfer Allocation for Open Access Using Graph Theory ...Felix F Wu, Yixin Ni, Ping Wei - 2000 - IEEE TRANSACTIONS ON POWER SYSTEMS Constraints On Simple Geometry In Two And Three DimensionsJOHN С OWEN - 1996 - International Journal of Computational Geometry & Applications References from web pagesUniversity of Oklahoma || School of Computer Science Reference Lists Graphs: theory and algorithms 《Graphs: Theory and Algorithms》ISBN:0471513563John Wiley & Sons ... 第1 章绪论 k thulasiraman libri - I Libri dell'autore: K Thulasiraman ... Wiley::Nonlinear Programming: Theory and Algorithms, 3rd Edition livre graphs : theory and algorithms (ed '92), 2 ordm cycle, maths ... Bibliographic information
|
