On the Problem of Finding Approximation of Bipatite Cliques

Proceedings of the Institute for System Programming of the RAS
doi 10.15514/ispras-2017-29(3)-12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for System Programming of the Russian Academy of Sciences

Related search

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

2020English

Finding Friends in the Crowd: Three-Dimensional Cliques of Topological Genomic Domains

Frontiers in Genetics
GeneticsMolecular Medicine
2019English

A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
2016English

The Creative Problem Finding Hierarchy: A Suggested Model for Understanding Problem Finding

Creativity
Visual ArtsPerforming ArtsStatisticsProbabilityHumanitiesUncertaintyArtsSocial PsychologyEducation
2018English

On One Variational Problem of the Piecewise-Linear Dynamical Approximation

Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki
Transfer ProcessesMathematicsFluid FlowComputer Science
2012English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

On the Finite Element Approximation of Solutions for Radiation Problem

RAIRO. Analyse numérique
1983English

Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

2011English

On Finding the Most Vital Job in Relocation Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy