graph theory algorithm theory (28 résultats)

paperback. Etat : New. Language:Chinese.Paperback. Publisher: Electronic Industry.

paperback. Etat : New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date :2010-10-01 Pages: 242 Language: Chinese Publisher: Machinery Industry Press Information Title: Graph Theory and Algorithms Price: 30 yuan Author : Lee Ming Press: Machinery Industry Press Publication Date : 2010 -10-1ISBN: 9787111317197 words: pages: 242 Edition : 1 Binding: Paperback Folio: 16 product ID: Editor's Summary This book is no introductory textbook on graph theory . introduces the basic concepts of graph theory . the fundamental theorem and algorithms. divided.Four Satisfaction guaranteed,or money back.

Softcover. Etat : gut. Auflage: 2. Ziel des Buches ist es, Grundlagen der Linearen Optimierung einzuführen und einige der klassischen polynomial lösbaren Probleme der Netzwerkoptimierung vorzustellen. Das Buch ist als Basis für zwei Lehrveranstaltungen, die im Modul "Optimierung" im Bachelor-Studium angeboten werden, geeignet. Das Besondere dieses Lehrbuches ist die Tatsache, dass die Textteile parallel auf Deutsch und Englisch formuliert wurden, so dass neben der Vermittlung des Grundwissens in mathematischer Optimierung auch eine Einführung ins Fachenglisch bzw. in die deutsche Sprache stattfindet. Über den Autor: Prof. Dr. Horst W. Hamacher ist Professor für Wirtschaftsmathematik an der Universität Kaiserslautern. Prof. Dr. Kathrin Klamroth lehrt am Fachbereich Mathematik der Universität Erlangen-Nürnberg. Inhaltsverzeichnis von "Lineare Optimierung und Netzwerkoptimierung": Introduction and Applications - The Simplex Method - Duality and Further Variations of the Simplex Method - Interior Point Methods: Karmarkar's Projective Algorithm - Introduction to Graph Theory and Shortest Spanning Trees - Shortest Path Problems - Network Flow Problems - Matchings Mathematik Informatik Duality graph theory Interior point methods Karmarkar's Projective Algorithm Lineare Optimierung Matchings Network Flow Problems Netzwerke Optimization shortest path problems Shortest Spanning Trees Simplex method Netzwerkoptimierung Mathematik Informatik Duality graph theory Interior point methods Karmarkar's Projective Algorithm Lineare Optimierung Matchings Network Flow Problems Netzwerke Optimization shortest path problems Shortest Spanning Trees Simplex method In deutscher Sprache. 240 pages. 23,8 x 17,2 x 1,6 cm.

paperback. Etat : New. Language:Chinese.Pages Number: 468 Publisher: Peking University Pub. Date :2011-1-1. Acmicpc race book selected topics. for example the classic graph algorithm described thinking. focusing on the process graph algorithms and graph theory algorithms to achieve the application. This book is divided into upper and lower two. The book for the first 1 to 5. in which Chapter 1 introduces the basic concepts of graph theory and graph representations of two types of storage: the adjacency matrix and a.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The image segmentation problem is concerned with partitioning an image into multiple regions according to some homogeneity criterion. This article is primarily concerned with graph theoretic approaches to image segmentation. OBJ CUT is an efficient method that automatically segments an object. The OBJ CUT method is a generic method, and therefore it is applicable to any object category model. Given an image D containing an instance of a known object category, e.g. cows, the OBJ CUT algorithm computes a segmentation of the object, that is, it infers a set of labels m.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! A trellis is a graph of which the nodes are ordered into vertical slices (time) and each node at each time is connected to (at least) one node at an earlier and (at least) one node at a later time. The earliest and latest times in the trellis have only one node.Trellises are used in encoders and decoders for communication theory and encryption. They are also the central datatype used in Baum-Welch algorithm for Hidden Markov Models.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a path from b to a. The strongly connected components (SCC) of a directed graph G are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of G. A directed graph is acyclic if and only if it has no (nontrivial) strongly connected subgraphs (because a cycle is strongly connected, and every strongly connected graph contains at least one cycle).

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The basic idea of the algorithm is this: a depth-first search begins from a start node. The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components. The nodes are placed on a stack in the order in which they are visited. When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component. If a node is the root of a strongly connected component, then it and all of the nodes taken off before it form that strongly connected component.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighed graph. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. This algorithm is a greedy algorithm, choosing the best choice given any situation. It is the reverse of Kruskal''s algorithm, which is another greedy algorithm to find a minimum spanning tree. Kruskal''s algorithm starts with an empty graph and adds edges while the Reverse-Delete algorithm starts with the original graph and deletes edges from it. The algorithm works as follows: Start with graph G, which contains a list of edges E. Go through E in decreasing order of edge weights. For each edge, check if deleting the edge will further disconnect the graph. Perform any deletion that does not lead to additional disconnection.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm. Its decision version, the vertex cover problem was one of Karp's 21 NP-complete problems and is therefore a classical NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory. The minimum vertex cover problem can be formulated as a half-integral linear program whose dual linear program is the maximum matching problem.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to speed up solving certain problems on the original graph. The treewidth measures the number of graph vertices mapped onto any tree node in an optimal tree decomposition. While it is NP-hard to determine the treewidth of a graph, many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to graphs of bounded treewidth.In machine learning, tree decompositions are also called junction trees, clique trees, or join trees; they play an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.The concept of tree decompositions and treewidth was introduced by Robertson & Seymour (1984) and has since been studied by many other authors.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a path graph is a particularly simple example of a tree, namely one which is not branched at all, that is, contains only nodes of degree two and one. In particular, two of its vertices have degree 1 and all others (if any) have degree.In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. A path may be infinite, but a finite path always has a first vertex, called its start vertex, and a last vertex, called its end vertex. Both of them are called end or terminal vertices of the path. The other vertices in the path are internal vertices. A cycle is a path such that the start vertex and end vertex are the same. Note that the choice of the start vertex in a cycle is arbitrary.

Taschenbuch. Etat : Neu. Trellis (Graph) | Graph (Mathematics), Encoders, Decoders, Communication Theory, Encryption, Baum-Welch Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131155642 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Segmentation Based Object Categorization | NP- Hard, Spectral Graph Theory, QR Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131393662 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. Reverse-delete Algorithm | Graph Theory, Minimum Spanning Tree, Kruskal's Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131259715 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Tarjan's Strongly Connected Components Algorithm | Graph Theory, Algorithm, Strongly Connected Components | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131171260 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Strongly Connected Component | Directed Graph, Vertex (Graph Theory), Subgraph, Directed Acyclic Graph, Kosaraju's Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131167188 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Maze Solving Algorithm | Algorithm, Maze, Tree (graph theory), Algorithms, Graph theory, Dead- end, Simply connected space, Mazes, Maze generation algorithm | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131652530 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Tree Decomposition | Graph Theory, Graph (Mathematics), Tree (Graph Theory), NP-hard, Machine Learning, Junction Tree Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131155048 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. Vertex Cover | Mathematics, Graph Theory, Graph, Optimization Problem, NP-Hard, Approximation Algorithm, Karp's 21 NP-Complete Problems, Computational Complexity Theory, Parameterized Complexity | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130356521 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.

Taschenbuch. Etat : Neu. Path Graph | Path (graph theory), Graph (mathematics), Vertex (graph theory), Algorithm, Graph Theory, Shortest Path proble, Travelling Salesman Problem, Cycle Space, Vector Space, Mathematical Structure | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130333997 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.