Journal ArticleDOI
On cliques in graphs
J. W. Moon,L. Moser +1 more
Reads0
Chats0
TLDR
In this article, the maximum number of cliques possible in a graph with n nodes is determined and bounds are obtained for the number of different sizes of clique possible in such a graph.Abstract:
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.read more
Citations
More filters
DissertationDOI
Exponential Time Complexity of SAT and Related Problems
TL;DR: There is a problem that has higher exponential time complexity than SAT and comparable problems, assuming the Exponential Time Hypothesis (ETH), and this problem is the Constraint Satisfaction Problem (CSP), which has a dependency of the complexity of CSP on the number of values a variable can take.
Proceedings Article
QUEST: Query-driven Exploration of Semistructured Data with ConflicTs and Partial Knowledge
TL;DR: This paper presents an assertion-based data model that captures both value-based and structure-based “nulls” in data, and introduces the QUEST system, which leverages the proposed model for Query-driven Exploration of Semistructured data with conflicT s and partial knowledge.
Book
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure"
TL;DR: This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure”, which brought together researchers interested in various aspects of enumeration algorithms; in particular classical output-sensitive enumeration including output-polynomial and polynomial delay algorithms and the inputsensitive enumeration.
Journal ArticleDOI
Fact-Alternating Mutex Groups for Classical Planning
Daniel Fišer,Antonín Komenda +1 more
TL;DR: This work provides a complexity analysis showing that inference of mutex groups is as hard as planning itself (PSPACE-Complete) and it also shows a tight relationship between mutEx groups and graph cliques.
DissertationDOI
Combinatorial approaches for the trunk packing problem
TL;DR: This thesis considers a three-dimensional packing problem arising in industry to pack a maximum number of rigid boxes with side length ratios of 4 : 2 : 1 into an irregularly shaped container and presents several heuristics based on linear programming relaxation or on local search.
References
More filters