The following pages link to On cliques in graphs (Q5920767):
Displaying 50 items.
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS (Q3449989) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- The Number of Maximal Independent Sets in a Tree (Q3708817) (← links)
- On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
- Complexity and performance of a graph theory algorithm for cluster analysis† (Q3962478) (← links)
- Cliques of a graph-variations on the Bron-Kerbosch algorithm (Q4185818) (← links)
- Constraints on the number of maximal independent sets in graphs (Q4284106) (← links)
- On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets (Q4558291) (← links)
- Below All Subsets for Minimal Connected Dominating Set (Q4683902) (← links)
- (Q4698131) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q4953537) (← links)
- Maximal independent sets and regularity of graphs (Q4958324) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- (Q5002730) (← links)
- (Q5009491) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- (Q5111887) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- (Q5135778) (← links)
- (Q5136240) (← links)
- DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS (Q5151269) (← links)
- Open Problems in Abstract Argumentation (Q5172624) (← links)
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Coverings, Matchings and the number of maximal independent sets of graphs (Q5377038) (← links)
- An upper bound for the number of maximal independent sets in a graph (Q5439059) (← links)
- Steiner's problem in graphs and its implications (Q5636922) (← links)
- An algorithm for determining the automorphism partitioning of an undirected graph (Q5645023) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Coalitions of arguments: A tool for handling bipolar argumentation frameworks (Q5851696) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Maximal Induced Matchings in Triangle-Free Graphs (Q5891021) (← links)
- On cliques in graphs (Q5921128) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- On cliques in graphs (Q5971413) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- On the maximum number of maximum independent sets in connected graphs (Q6055407) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Counting maximal independent sets in some \(n\)-gonal cacti (Q6064859) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- (Q6089653) (← links)
- On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza (Q6094038) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements (Q6113339) (← links)
