Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Spanning trees play an important role in the design of efficient routing algorithms and help solve computationally hard problems like the Steiner tree and the traveling salesperson problem. This is one of the most important concepts used in graph theory, as it forms the foundation of many theoretical results in practical fields like scheduling, clustering, data mining, and many others. Spanning Trees and Optimization Problems is the first book published on the use and applications associated with the modern study of spanning trees. It covers properties of spanning trees first, followed by the three categories of spanning trees: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees.
Choose an application
Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations
Discrete mathematics --- Maxima and minima --- Functions --- Trees (Graph theory) --- Data processing. --- Data processing --- Graph theory --- Minima --- Mathematics --- Maxima and minima - Data processing --- Functions - Data processing --- Trees (Graph theory) - Data processing
Choose an application
This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
Trees (Graph theory) --- Data processing --- Trees (Graph theory) - Data processing. --- Information theory. --- Computer software. --- Combinatorics. --- Computer graphics. --- Theory of Computation. --- Algorithm Analysis and Problem Complexity. --- Computer Graphics. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Combinatorics --- Algebra --- Mathematical analysis --- Software, Computer --- Computer systems --- Communication theory --- Communication --- Cybernetics --- Digital techniques
Choose an application
Computational complexity --- Data structures (Computer science) --- Trees (Graph theory) --- 681.3*D1 --- 681.3*E1 --- 681.3*F --- 681.3*F Theory of computation --- Theory of computation --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- Data structures: arrays; graphs; lists; tables; trees --- Graph theory --- 681.3*D1 Programming techniques--See also {681.3*E} --- Programming techniques--See also {681.3*E} --- Congresses --- Data processing&delete& --- Congresses. --- Data processing --- Trees (Graph theory) - Data processing - Congresses. --- Data structure (Computer science) - Congresses. --- Computational complexity - Congresses.
Listing 1 - 4 of 4 |
Sort by
|