相关论文: A linear-time algorithm for the strong chromatic i…

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…

We report on a recent breakthrough in rule-based graph programming, which allows us to reach the time complexity of imperative linear-time algorithms. In general, achieving the complexity of graph algorithms in conventional languages using…

Rank of divisor on graph was introduced in 2007 and it quickly attracts many attentions. Recently, in 2015 the problem for computing this quantity was proved to be NP-hard. In this paper, we describe a linear time algorithm for this problem…

We describe an algorithm to compute the Wiener index of a sequence of finite graphs approximating the Sierpinski carpet.

We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

To solve the Cahn-Hilliard equation numerically, a new time integration algorithm is proposed, which is based on a combination of the Eyre splitting and the local iteration modified (LIM) scheme. The latter is employed to tackle the…

We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…

We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer…

We show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…

A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of $G$, is the smallest integer $k$ for which $G$…

The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

A linear time algorithm to find a set of nearest elements in a mesh.

An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we…

A Halin graph is a graph obtained by embedding a tree having no nodes of degree two in the plane, and then adding a cycle to join the leaves of the tree in such a way that the resulting graph is planar. According to the four color theorem,…

We give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results.

We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…

The strong chromatic index of a multigraph is the minimum $k$ such that the edge set can be $k$-colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gy\'{a}rf\'{a}s, Schelp and Tuza, showing that…