Results 41 to 50 of about 1,168 (127)
On retracts, absolute retracts, and folds in cographs [PDF]
, 2013 Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameterized by the size of H. When restricted to the class of threshold graphs or
A. Máté +16 more
core +1 more source
Confining the robber on cographs
Contributions to Discrete Mathematics, 2023 In a game of Cops and Robbers on graphs, usually the cops' objective is to capture the robber---a situation which the robber wants to avoid invariably. In this paper, we begin with introducing the notions of trapping and confining the robber and discussing their relations with capturing the robber.
openaire +3 more sources
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 +17 more
core +1 more source
Faster Query Answering in Probabilistic Databases using Read-Once Functions [PDF]
, 2010 A boolean expression is in read-once form if each of its variables appears exactly once. When the variables denote independent events in a probability space, the probability of the event denoted by the whole expression in read-once form can be computed ...
Perduca, Vittorio +2 more
core +2 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
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
Minimal obstructions to 2-polar cographs [PDF]
Discrete Applied Mathematics, 2019 Comment: 17 pages, 5 ...
Hell, Pavol +2 more
openaire +3 more sources
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
A Linear Recognition Algorithm for Cographs
SIAM Journal on Computing, 1985 Cographs are the graphs formed from a single vertex under the closure of the operations of union and complement. Another characterization of cographs is that they are the undirected graphs with no induced paths on four vertices. Cographs arise naturally in such application areas as examination scheduling and automatic clustering of index terms ...
Corneil, D. G., Perl, Y., Stewart, L. K.
openaire +2 more sources