Results 31 to 40 of about 1,423 (126)

On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions

, 2015
Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find a symbolic ultrametric that, in addition, distinguishes between edges and
A Burstein, D Achlioptas, DG Corneil, DG Corneil, J Gimbel, J Misra, LK Pudwell, M Hellmuth, M Hellmuth, M Lafond, P Brändén, P Dorbec, R Hammack, S Bilotta, S Böcker, VG Vizing, Y Liu, Y Liu   +17 more
core   +1 more source

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 Diagonalization Algorithm for the Distance Matrix of Cographs

IEEE Access, 2018
Cographs is a well-known class of graphs in graph theory, which can be generated from a single vertex by applying a series of complement (or equivalently join operations) and disjoint union operations.
Zhibin Du
doaj   +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, M. Camacho-Collados, Francisco Chicano   +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, Elfadil A. Mohamed, Antonio Mora, Seiji Shibasaki   +3 more
wiley   +1 more source

Proofs Without Syntax

, 2006
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects.
Hughes, Dominic
core   +4 more sources

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

Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs

Networks, Volume 85, Issue 4, Page 351-367, June 2025.
ABSTRACT A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the
Giuseppe Ambrosio, Raffaele Cerulli, Domenico Serra, Carmine Sorgente, Ugo Vaccaro   +4 more
wiley   +1 more source

On forbidden subgraphs of main supergraphs of groups

Electronic Research Archive
In this study, we explore the main supergraph $ \mathcal{S}(G) $ of a finite group $ G $, defined as an undirected, simple graph with a vertex set $ G $ in which two distinct vertices, $ a $ and $ b $, are adjacent in $ \mathcal{S}(G) $ if the order of ...
Xiaoyan Xu, Xiaohua Xu, Jin Chen, Shixun Lin   +3 more
doaj   +1 more source

A survey on algorithmic aspects of modular decomposition

, 2009
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important preprocessing step to
Habib, Michel, Paul, Christophe
core   +3 more sources