Results 231 to 240 of about 6,072 (265)

Co-2-plex vertex partitions

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin McClosky, John D. Arellano, Illya V. Hicks   +2 more
openaire   +1 more source

Vertex partitions of graphs into cographs and stars

J. Graph Theory, 2014
Summary: A cograph is a graph that contains no path on four vertices as an induced subgraph. A cograph \(k\)-partition of a graph \(G\) = (\(V,E\)) is a vertex partition of \(G\) into \(k\) sets \(V_{1}, \ldots , V_{k} \subset V\) so that the graph induced by \(V_{i}\) is a cograph for \(1 \leq i \leq k\). \textit{J. Gimbel} and \textit{J.
Paul Dorbec, Mickaël Montassier, Pascal Ochem   +2 more
openaire   +1 more source

Computational techniques for vertex partitioning of graphs

Journal of Chemical Information and Computer Sciences, 1990
A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens-Householder ...
Xiaoyu Liu 0007, Krishnan Balasubramanian, Morton E. Munk   +2 more
openaire   +2 more sources

A rooted-forest partition with uniform vertex demand

Journal of Combinatorial Optimization, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoki Katoh, Shin-ichi Tanigawa
openaire   +1 more source

Partition conditions and vertex-connectivity of graphs

Combinatorica, 1981
It was proved ([5], [6]) that ifG is ann-vertex-connected graph then for any vertex sequencev 1, ...,v n ≠V(G) and for any sequence of positive integersk 1, ...,k n such thatk 1+...+k n =|V(G)|, there exists ann-partition ofV(G) such that this partition separates the verticesv 1, ...,v(n), and the class of the partition containingv i induces a ...
openaire   +2 more sources

Vertex partitions and maximum degenerate subgraphs

Journal of Graph Theory, 2007
AbstractLet G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has a vertex partition S1, S2 such that G[S1] is a maximum order (p1‐1)‐degenerate subgraph of G and G[S2] is a (p2‐1)‐degenerate subgraph, where G[Si]
openaire   +1 more source

A Graph Partitioning Algorithm for Edge or Vertex Balance

2020
The definition of effective strategies for graph partitioning is a major challenge in distributed environments since an effective graph partitioning allows to considerably improve the performance of large graph data analytics computations. In this paper, we propose a multi-objective and scalable Balanced GRAph Partitioning (B-GRAP) algorithm to produce
Adnan El Moussawi, Nacéra Bennacer Seghouani, Francesca Bugiotti   +2 more
openaire   +1 more source

Vertex partitioning problems on partial k-trees

1996
We describe a general approach to obtain polynomial-time algorithms over partial k-trees for graph problems in which the vertex set is to be partitioned in some way. We encode these problems with formulae of the Extended Monadic Second-order (or EMS) logic. Such a formula can be translated into a polynomial-time algorithm automatically. We focus on the
Gupta, A., Kaller, D., Mahajan, S., Shermer, T.   +3 more
openaire   +2 more sources

Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing

IEEE Transactions on Systems, Man, and Cybernetics, 1980
In this paper we have pursued the initial vertex partioning methodology for a graph (digraph) isomorphism testing problem using lexicographic ordering of vertex codes. The newly introduced vertex codes (which may be of fixed length or of variable length) incorporate order independent parameters of a graph in relation to a vertex and can be computed ...
openaire   +2 more sources

Optimal Vertex Partitions

Bulletin of the London Mathematical Society, 1979
Bollobas, Bela, Manvel, Bennet
openaire   +2 more sources