Results 51 to 60 of about 1,967 (126)
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
Minimal obstructions to 2-polar cographs [PDF]
Discrete Applied Mathematics, 2019 Comment: 17 pages, 5 ...
Hell, Pavol +2 more
openaire +3 more sources
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 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
Limits of Structures and the Example of Tree-Semilattices [PDF]
, 2015 The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years.
Charbit, Pierre +2 more
core +4 more sources
The complexity of dominating set reconfiguration
, 2015 Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each ...
A Suzuki +11 more
core +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Networks, Volume 86, Issue 3, Page 325-357, October 2025.ABSTRACT The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
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
The Electronic Journal of Combinatorics, 2003 The rank of the adjacency matrix of a graph is bounded above by the number of distinct non-zero rows of that matrix. In general, the rank is lower than this number because there may be some non-trivial linear combination of the rows equal to zero. We show the somewhat surprising result that this never occurs for the class of cographs.
openaire +2 more sources