Results 31 to 40 of about 2,983 (119)
Finding Cycles and Trees in Sublinear Time [PDF]
, 2011 We present sublinear-time (randomized) algorithms for finding simple cycles of length at least $k\geq 3$ and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being $C_k$-minor-free ...
Alon +20 more
core +4 more sources
Sigma Partitioning: Complexity and Random Graphs
, 2018 A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ahadi, Arash +2 more
core +1 more source
Distant sum distinguishing index of graphs
, 2017 Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every ...
Przybyło, Jakub
core +1 more source
Breaking Instance-Independent Symmetries In Exact Graph Coloring
, 2011 Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning,
Aloul, F. A. +3 more
core +1 more source
Distinguishing Chromatic Number of Random Cayley graphs
, 2016 The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan +1 more
core +1 more source
A proper total coloring distinguishing adjacent vertices by sums of some product graphs
, 2014 In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak \cite{PW}
Choi, Hana +3 more
core +1 more source
Hipergráfok = Hypergraphs [PDF]
, 2010 A projekt célkitűzéseit sikerült megvalósítani. A négy év során több mint száz kiváló eredmény született, amiből eddig 84 dolgozat jelent meg a téma legkiválóbb folyóirataiban, mint Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory,
Elek, Gábor +8 more
core
On the neighbour sum distinguishing index of planar graphs
, 2016 Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in
Bonamy, Marthe, Przybyło, Jakub
core +4 more sources
Stackelberg Network Pricing is Hard to Approximate
, 2008 In the Stackelberg Network Pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path
Bouhtou +6 more
core +1 more source
Exact bosonization of the Ising model [PDF]
, 2011 We present exact combinatorial versions of bosonization identities, which equate the product of two Ising correlators with a free field (bosonic) correlator.
Dubédat, Julien
core