DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Maximal independent set
Maximal independent set
Towards Maximum Independent Sets on Massive Graphs
Matroids You Have Known
Greedy Sequential Maximal Independent Set and Matching Are Parallel on Average
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Maximal Independent Set
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
(1, K)-Swap Local Search for Maximum Clique Problem
Greedy Maximal Independent Sets Via Local Limits
A Parallel Maximal Independent Set Algorithm
Improved Distributed Approximations for Maximum Independent
The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments Etsuji Tomitaa,∗, Akira Tanakaa,B, Haruhisa Takahashia
Maximal Independent Sets in Caterpillar Graphs✩,✩✩
Study of Greedy Algorithm for Solving Maximum Independent Set Problem
Independence Number of Maximal Planar Graphs Allan Bickle
The Maximum Independent Set Problem and Augmenting Graphs
Chapter 6: Maximal Independent
Matroids Are Combinatorial Structures That Abstract the Properties of Linear In- Dependence of Vector Spaces and Related Properties of Graphs
Top View
On Graphs Admitting Two Disjoint Maximum Independent Sets
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees
A Characterization and Hereditary Properties for Partition Graphs
Super-Fast 3-Ruling Sets∗
Maximal Independent Sets in Minimum Colorings
Finding Independent Sets in a Graph Using Continuous Multivariable Polynomial Formulations
Greed Is Good : Approximating Independent Sets in Sparse and Bounded-Degree Graphs Y 1 Introduction
Maximal Independent Set
Maximal and Maximum Independent Sets in Graphs
On the Complexity of the Independent Set Problem in Triangle Graphs
ABC of Graph Theory
Coloring Large Graphs Based on Independent Set Extraction
Maximal Independent Sets in Bipartite Graphs with at Least One Cycle Shuchao Li, Huihui Zhang, Xiaoyan Zhang
Arboricity and Subgraph Listing Algorithms*
Independent Sets Versus Perfect Matchings*
Extension of Vertex Cover and Independent Set in Some Classes of Graphs and Generalizations
Strong Cliques in Vertex-Transitive Graphs
Statistical Mechanics of Maximal Independent Sets