Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering - Germany
doi 10.1007/s41019-017-0033-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Efficient Enumeration of Graph Orientations With Sources

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Implementation Issues of Clique Enumeration Algorithm

Progress in Informatics
2012English

Maximal-Clique Partitions of Interval Graphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1988English

The Complexity of Clique Graph Recognition

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space

International Journal of Advanced Computer Science and Applications
Computer Science
2020English

Voter Model on the Two-Clique Graph

Physical Review E
2014English

An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

Efficient Information Extraction Over Evolving Text Data

2008English

Efficient Register Allocation via Coloring Using Clique Separators

ACM Transactions on Programming Languages and Systems
Software
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy