99
Voted
EJC
2016
10 years 1 days ago
2016
Abstract. In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of triangles, for a matroid to have either U2,...
EJC
2016
10 years 1 days ago
2016
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture ...
EJC
2016
10 years 1 days ago
2016
We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fou...
EJC
2016
10 years 1 days ago
2016
Szemer´edi’s regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov´asz and Szegedy [7] gave a Hilb...
EJC
2016
10 years 1 days ago
2016
The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists n ∈ N such that the block complexity function Pη(n...
178
click to vote
EJC
2016
10 years 1 days ago
2016
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
123
click to vote
EDBT
2016
ACM
10 years 1 days ago
2016
ACM
State of the art RDF stores often rely on exhaustive indexing and sequential (self-)joins for SPARQL query processing. However, query execution is dependent on, and often limited ...
124
click to vote
EDBT
2016
ACM
10 years 1 days ago
2016
ACM
There is considerable interest in the design and development of distributed systems that can execute algorithms to process large graphs. Serializability guarantees that parallel e...
242
Voted
EDBT
2016
ACM
10 years 1 days ago
2016
ACM
Data wrangling is the process by which the data required by an application is identified, extracted, cleaned and integrated, to yield a data set that is suitable for exploration ...