Results 41 to 50 of about 1,883 (72)
On variables with few occurrences in conjunctive normal forms [PDF]
, 2011 We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables.
C.A. Tovey +8 more
core +1 more source
On the chromatic number of some flip graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Graphs and ...
Ruy Fabila-Monroy +5 more
doaj +1 more source
Generating constrained random graphs using multiple edge switches [PDF]
, 2010 The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions.
Cointet, Jean-Philippe +2 more
core +4 more sources
On symmetric structures of order two [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Combinatorics
Michel Bousquet, Cédric Lamathe
doaj +1 more source
"Minesweeper" and spectrum of discrete Laplacians
, 2009 The paper is devoted to a problem inspired by the "Minesweeper" computer game. It is shown that certain configurations of open cells guarantee the existence and the uniqueness of solution. Mathematically the problem is reduced to some spectral properties
E. Lakshtanov, Mossel E, O. German
core +1 more source
Leftmost derivations of propagating scattered context grammars: a new proof [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Automata, Logic and ...
Tomáš Masopust, Jiří Techet
doaj +1 more source
Graphs that are not pairwise compatible: A new proof technique (extended abstract) [PDF]
, 2018 A graph G = (V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dminand dmax, dmin≤ dmax, such that each node u∈V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if
Baiocchi, Pierluigi +3 more
core +1 more source
Extremal K_(s,t)-free bipartite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Camino Balbuena +3 more
doaj +1 more source
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3 [PDF]
, 2013 The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental results from our implementation of the Enumeration Based Search Algorithm ...
Nittoor, Vivek S, Suda, Reiji
core
Connectivity Functions and Polymatroids
, 2016 A {\em connectivity function on} a set $E$ is a function $\lambda:2^E\rightarrow \mathbb R$ such that $\lambda(\emptyset)=0$, that $\lambda(X)=\lambda(E-X)$ for all $X\subseteq E$ and that $\lambda(X\cap Y)+\lambda(X\cup Y)\leq \lambda(X)+\lambda(Y)$ for
Jowett, Susan +2 more
core +1 more source