Suchergebnisse - Mathematics of computing Discrete mathematics Graph theory Graph enumeratio*

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

On the Expressive Power of Homomorphism Counts von Atserias, Albert, Kolaitis, Phokion G., Wu, Wei-Lin

“… A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the number of homomorphisms from F to G coincides with the number …”
Volltext

Enumerating Minimal Solution Sets for Metric Graph Problems von Bergougnoux, Benjamin, Defrain, Oscar, Mc Inerney, Fionn

“… Problems from metric graph theory like Metric Dimension , Geodetic Set , and Strong Metric Dimension have recently had an impact in parameterized complexity by being the first known problems in NP …”
Volltext

Parallelizing Maximal Clique Enumeration on GPUs von Almasri, Mohammad, Chang, Yen-Hsiang, Hajj, Izzat El, Nagi, Rakesh, Xiong, Jinjun, Hwu, Wen-mei

“… We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm …”
Volltext

GraphMini: Accelerating Graph Pattern Matching Using Auxiliary Graphs von Liu, Juelin, Polisetty, Sandeep, Guan, Hui, Serafini, Marco

“… Graph pattern matching is a fundamental problem encountered by many common graph mining tasks and the basic building block of several graph mining systems …”
Volltext

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction von Gui, Chuangyi, Liao, Xiaofei, Zheng, Long, Yao, Pengcheng, Wang, Qinggang, Jin, Hai

“… Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance …”
Volltext

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width von Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou Moustapha, Kratsch, Dieter, Sæther, Sigve H., Villanger, Yngve

“… In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width …”
Volltext

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs von Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew

“… We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs …”
Volltext

Optimal Join Algorithms Meet Top- k von Tziavelis, Nikolaos, Gatterbauer, Wolfgang, Riedewald, Mirek

“… have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results …”
Weitere Angaben

Linear Algebra Approach for Directed Triad Counting and Enumeration von Kerdcharoen, Yuttapichai, Sridhar, Upasana, Sangpetch, Orathai, Low, Tze Meng

“… Triangle counting and enumeration are commonly used in real-world applications on directed graphs …”
Volltext

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length von Giscard, Pierre-Louis, Kriege, Nils, Wilson, Richard C.

“… )graph on N vertices and M edges, achieving an asymptotic running time of O N + M + ( ℓ ω + ℓ Δ ) | S ℓ | . In this expression …”
Volltext

Enumerating k-Arc-Connected Orientations von Blind, Sarah, Knauer, Kolja, Valicov, Petru

“… We study the problem of enumerating the k -arc-connected orientations of a graph G , i.e …”
Volltext

Enumeration aspects of maximal cliques and bicliques von Gély, Alain, Nourine, Lhouari, Sadi, Bachir

“… We present a general framework to study enumeration algorithms for maximal cliques and maximal bicliques of a graph …”
Volltext

An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face von Bentz, Cédric

“… Given a list of k source–sink pairs in an edge-weighted graph G , the minimum multicut problem consists in selecting a set of edges of minimum total weight in G , such that removing these edges leaves no path from each source …”
Volltext

Computational aspects of monotone dualization: A brief survey von Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

“… ) is a problem which, in different disguise, is ubiquitous in many areas including Computer Science, Artificial Intelligence, and Game Theory to mention some of them …”
Volltext

Enumeration of Billions of Maximal Bicliques in Bipartite Graphs without Using GPUs von Pan, Zhe, He, Shuibing, Li, Xu, Zhang, Xuechen, Yin, Yanlong, Wang, Rui, Shou, Lidan, Song, Mingli, Sun, Xian-He, Chen, Gang

“… Maximal biclique enumeration (MBE) is crucial in bipartite graph analysis. Recent studies rely on extensive set intersections on static bipartite graphs to solve the MBE problem …”
Volltext

Improved Enumeration of Simple Topological Graphs von Kyncl, Jan

“… A simple topological graph T = ( V ( T ) , E ( T ) ) is a drawing of a graph in the plane where every two edges have at most one common point …”
Volltext

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k von Beideman, Calvin, Chandrasekaran, Karthekeyan, Wang, Weihang

“… . The special cases of Hypergraph- k -Cut and Enum-Hypergraph- k -Cut restricted to graph inputs are well-known to be solvable …”
Volltext

On the Number of Coloured Triangulations of d-Manifolds von Chapuy, Guillaume, Perarnau, Guillem

“… We give superexponential lower and upper bounds on the number of coloured d -dimensional triangulations whose underlying space is an oriented manifold, when …”
Volltext

The ordered k-median problem: surrogate models and approximation algorithms von Aouad, Ali, Segev, Danny

“… In the last two decades, a steady stream of research has been devoted to studying various computational aspects of the ordered k -median problem, which …”
Volltext