Faster Sublinear Approximation of the Number of K-Cliques in Low-Arboricity Graphs

doi 10.1137/1.9781611975994.89
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Sublinear Time Approximation of the Cost of a Metric K-Nearest Neighbor Graph

2020English

Point Arboricity Critical Graphs Exist

Journal of the London Mathematical Society
Mathematics
1975English

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

2011English

Ordered Graphs and Large Bi-Cliques in Intersection Graphs of Curves

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

On the Problem of Finding Approximation of Bipatite Cliques

Proceedings of the Institute for System Programming of the RAS
2017English

An Approach to Determination of Maximal Cliques in Undirected Graphs

International Journal of Modern Education and Computer Science
2018English

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

2006English

A Note on Bipartite Graphs Whose [1,k]-Domination Number Equal to Their Number of Vertices

Opuscula Mathematica
Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy