Results 21 to 30 of about 438 (125)
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ekim, T., Mahadev, N.V.R., de Werra, D.
openaire +2 more sources
Characterizing and computing minimal cograph completions [PDF]
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Papadopoulos, C. +2 more
openaire +2 more sources
Partitions of Graphs into Cographs
Electronic Notes in Discrete Mathematics, 2002 A cograph is a graph that can be constructed by a single vertex using complementation and disjoint union operations. Equivalently, cographs are exactly those graphs which do not contain an induced path \(P_4\) with four vertices and three edges. The \(c\)-chromatic number \(c(G)\) of a graph \(G\) is the minimum number \(k\) such that the vertex set of
Gimbel, John, Nešetřil, Jaroslav
openaire +2 more sources
Characterizing –partitionable Cographs
Electronic Notes in Discrete Mathematics, 2005 Abstract We consider the problem of partitioning a graph into k independent sets and l cliques, known as the ( k , l ) -partition problem, which was introduced by Brandstadt in [A. Bransdstadt, Partitions of graphs into one or two independent sets and cliques, Discrete Mathematics 152 (1996) 47–54], and generalized by Feder et al.
Raquel de Souza Francisco +2 more
openaire +1 more source
On Certain Eigenspaces of Cographs [PDF]
The Electronic Journal of Combinatorics, 2008 For every cograph there exist bases of the eigenspaces for the eigenvalues $0$ and $-1$ that consist only of vectors with entries from $\{0, 1, -1\}$, a property also exhibited by other graph classes. Moreover, the multiplicities of the eigenvalues $0$ and $-1$ of a cograph can be determined by counting certain vertices of the associated cotree.
openaire +2 more sources
Algorithmic aspects of switch cographs
Discrete Applied Mathematics, 2016 This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results.
Cohen-Addad, Vincent +2 more
openaire +3 more sources
A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs
Advances in Operations Research, Volume 2017, Issue 1, 2017., 2017 Given a graph G = (V, E), a connected sides cut (U, V\U) or δ(U) is the set of edges of E linking all vertices of U to all vertices of V\U such that the induced subgraphs G[U] and G[V\U] are connected. Given a positive weight function w defined on E, the maximum connected sides cut problem (MAX CS CUT) is to find a connected sides cut Ω such that w(Ω ...
Brahim Chaourar, Yi-Kuei Lin
wiley +1 more source
A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph
Mathematical Problems in Engineering, Volume 2016, Issue 1, 2016., 2016 In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use.
F. Liberatore +2 more
wiley +1 more source
Characterization of Protein Complexes and Subcomplexes in Protein‐Protein Interaction Databases
Biochemistry Research International, Volume 2015, Issue 1, 2015., 2015 The identification and characterization of protein complexes implicated in protein‐protein interaction data are crucial to the understanding of the molecular events under normal and abnormal physiological conditions. This paper provides a novel characterization of subcomplexes in protein interaction databases, stressing definition and representation ...
Nazar Zaki +3 more
wiley +1 more source
Some New Classes of Open Distance‐Pattern Uniform Graphs
International Journal of Combinatorics, Volume 2013, Issue 1, 2013., 2013 Given an arbitrary nonempty subset M of vertices in a graph G = (V, E), each vertex u in G is associated with the set fMo(u)={d(u,v) : v∈M, u≠v} and called its open M‐distance‐pattern. The graph G is called open distance‐pattern uniform (odpu‐) graph if there exists a subset M of V(G) such that fMo(u)=fMo(v) for all u, v ∈ V(G), and M is called an open
Bibin K. Jose, Toufik Mansour
wiley +1 more source