Suchergebnisse - Graph theory—Graph al- algorithms

Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA von DIMACS Implementation Challenge Workshop, Bader, David A.

“… To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li …”
Volltext

Lovász-Type Theorems and Game Comonads von Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“… As special cases of this general theorem, we obtain two variants of Lovász' theorem: the result by Dvořák (2010) that characterises equivalence of graphs in the k …”
Volltext

Handbook of chemoinformatics algorithms von Faulon, Jean-Loup, Bender, Andreas

“… It explains how algorithms and graph theory are applied to chemical problems, such as structure-activity/property predictions …”
Volltext

Multi-response optimization in WEDM process of Al–Si alloy using TLBO-graph theory algorithm towards sustainability von Venkatarao, Kaki, Reddy, Malla Chaitanya, Kumar, Yekula Prasanna, Raju, Lam Suvarna, Rao, Bonula Rama, Azad, Duppala

“… The HTLBO comprises teaching and learning–based optimization technique and graph theory algorithm to improve WEDM performance …”
Volltext

Graph Algorithms and Applications 5 von Liotta, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G

“… This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication …”
Volltext

Graph Algorithms and Applications 4 von Liotta, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G

“… This book contains Volume 7 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication …”
Volltext

Graph algorithms and applications 3 von Liotta, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G

“… This book contains Volume 6 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication …”
Volltext

Building a Sybil-Resilient Digital Community Utilizing Trust-Graph Connectivity von Poupko, Ouri, Shahaf, Gal, Shapiro, Ehud, Talmon, Nimrod

“… consensus, tilt decisions, or even take over. Here, we explore the use of a trust-graph of identities, with edges representing trust among identity owners, to allow a community to grow indefinitely without increasing its sybil penetration …”
Volltext

Listing all maximal k-plexes in temporal graphs von Bentert, Matthias, Himmel, Anne-Sophie, Molter, Hendrik, Morik, Marco, Niedermeier, Rolf, Saitenmacher, René

“… Himmel et al. [SNAM 2017] showed how to adapt the well-known Bron-Kerbosch algorithm for listing static cliques to listing Δ-cliques …”
Volltext

Abelian networks IV. Dynamics of nonhalting networks von Chan, Swee Hong, Levine, Lionel

“… An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This …”
Volltext

An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs von Teslenko, Maxim, Dubrova, Elena

“… Graph dominators provide a general mechanism for identifying re-converging paths in circuits …”
Volltext

Structural Testing Based on Minimum Kernels von Dubrova, Elena

“… ) of the kernel executes all vertices (edges) of the program's flowgraph. We present a linear-time algorithm for computing minimum kernels based on pre- and post-dominator …”
Volltext

GLMLE: graph-limit enabled fast computation for fitting exponential random graph models to large social networks von He, Ran, Zheng, Tian

“… Among popular models, exponential random graph models (ERGMs) have been developed to study these complex networks by directly modeling network structures and features …”
Volltext

The Traveling Salesman Problem: A Computational Study von Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J

“… This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It …”
Volltext

Boolean Technology Mapping Based on Logic Decomposition von Damiani, Maurizio, Selchenko, Andrei Y.

“… ], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation of library elements …”
Volltext

Graph algorithms and applications von Tamassia, Roberto, Tollis, Ioannis G., Liotta, Giuseppe

“… This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication …”
Volltext

Efficient instruction-level optimization methodology for low-power embedded systems von Choi, Kyu-won, Chatterjee, Abhijit

“… ), both of which are NP-Hard [1,2]. We propose an efficient instruction-level optimization algorithm for solving the NP-Hard problem …”
Volltext

Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network von Bian, Qing-Rong, Cheng, Bao-Lei, Fan, Jian-Xi, Pan, Zhi-Yong

“… Dragonfly network, proposed by Kim et al.,is a topology for high-performance computer …”
Volltext

Graph algorithms and applications I von Tamassia, Roberto, Tollis, Ioannis G

“… This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA …”
Volltext

B3: A Block-based Method for Estimating Similarity for Inter-Graph Vertice von Zou, Li, Du, Xiaoyong, He, Jun

“… Blondel et al have extended the problem to similarity computation between two directed graphs …”
Volltext