Search Results - Mathematics of computing Discrete mathematics Graph theory Graph enumeration

Lovász-Type Theorems and Game Comonads by 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…”
Get full text

On the Expressive Power of Homomorphism Counts by 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…”
Get full text

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs by 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…”
Get full text

Efficient Maximal Biclique Enumeration on GPUs by Pan, Zhe, He, Shuibing, Li, Xu, Zhang, Xuechen, Wang, Rui, Chen, Gang

“…Maximal biclique enumeration (MBE) in bipartite graphs is an important problem in data mining with many real-world applications…”
Get full text

Towards a faster network-centric subgraph census by Paredes, Pedro, Ribeiro, Pedro

“…Determining the frequency of small subgraphs is an important computational task lying at the core of several graph mining methodologies, such as network motifs discovery or graphlet based measurements…”
Get full text

Test Pattern Compression Using Prelude Vectors in Fan-Out Scan Chain with Feedback Architecture by Oh, Nahmsuk, Kapur, Rohit, Williams, T. W., Sproch, Jim

“…This paper proposes a new test compression technique that employs Fan-out SCAN chain with Feedback (FSCANF) architecture. It allows us to use prelude vectors…”
Get full text

How Does Label Propagation Algorithm Work in Bipartite Networks? by Liu, Xin, Murata, Tsuyoshi

“…Community detection in networks receives much attention recently. In this paper, we investigate a recently proposed community detection algorithm—label…”
Get full text

Bipartite Graph Based Entity Ranking for Related Entity Finding by Lei Cao, Jiafeng Guo, Xueqi Cheng

“… In this paper, we propose a bipartite graph based entity ranking method, which leverage the Co-List relationship between candidate entities (i.e…”
Get full text

Distributed coloring in Õ (√log n) Bit Rounds by Kothapalli, Kishore, Scheideler, Christian, Onus, Melih, Schindelhauer, Christian

“…We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color…”
Get full text

A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation by Law, Terence H. -W., Pearce, Adrian R.

“… distribution through graph decomposition and multi-stage solution quality propagation. Experimental result shows that our new algorithm is faster than a recent competitive distributed algorithm for solving MaxSAT graph colouring problems…”
Get full text

Social Semantics and Its Evaluation by Means of Semantic Relatedness and Open Topic Models by Waltinger, Ulli, Mehler, Alexander

“…This paper presents an approach using social semantics for the task of topic labelling by means of Open Topic Models. Our approach utilizes a social ontology…”
Get full text

A Labeled Graph Approach to Analyze Organizational Performance by Hoogendoorn, Mark, Treur, Jan, Yolum, Pinar

“… To perform such an analysis, this paper represents organizations as labeled graphs that capture, not only the interactions of the entities, but also the characteristics of those interactions…”
Get full text

MRPF: An Architectural Transformation for Synthesis of High-Performance and Low-Power Digital Filters by Choo, Hunsoo, Muhammad, Khurram, Roy, Kaushik

“…We present a graph theoretical methodology that reduces the implementation complexity of a vector multiplied by a scalar…”
Get full text

Spill Code Minimization by Spill Code Motion by Koseki, Akira, Komatsu, Hideaki, Nakatani, Toshio

“… This works as a variation of commonly used code motion techniques. After Chaitin-style graph coloring…”
Get full text

Enumerating Minimal Solution Sets for Metric Graph Problems by 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…”
Get full text

GraphMini: Accelerating Graph Pattern Matching Using Auxiliary Graphs by 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…”
Get full text

Parallelizing Maximal Clique Enumeration on GPUs by 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…”
Get full text

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction by 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…”
Get full text

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width by 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…”
Get full text

Optimal Join Algorithms Meet Top- k by 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…”
Get more information