Discrete Applied Mathematics, ISSN 0166-218X, 12/2017, Volume 232, p. 125

And/or graphs are well-known data structures with several applications in many fields of computer science, such as Artificial Intelligence, Distributed...

Computer science | Minimum weight | Operations research | Graphs | Data structures | Graph theory | Computer networks | Artificial intelligence | Optimization | Software engineering

Computer science | Minimum weight | Operations research | Graphs | Data structures | Graph theory | Computer networks | Artificial intelligence | Optimization | Software engineering

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 02/2018, Volume 713, pp. 1 - 10

Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to...

Enumerative combinatorics | Cographs | Enumerative algorithms | COMPUTER SCIENCE, THEORY & METHODS | GRAPHS | Algorithms

Enumerative combinatorics | Cographs | Enumerative algorithms | COMPUTER SCIENCE, THEORY & METHODS | GRAPHS | Algorithms

Journal Article

Information Processing Letters, ISSN 0020-0190, 03/2020, Volume 155, p. 105899

•We present an O(n)-time algorithm for Vector Domination in split-indifference graphs.•Cases of the algorithm are based on a structural characterization of...

Unit interval graph | Split graph | Vector Domination problem | Graph algorithms | Split-indifference graph | NUMBER | SETS | COMPUTER SCIENCE, INFORMATION SYSTEMS

Unit interval graph | Split graph | Vector Domination problem | Graph algorithms | Split-indifference graph | NUMBER | SETS | COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2010, Volume 158, Issue 12, pp. 1268 - 1274

The study of monophonic convexity is based on the family of induced paths of a graph. The closure of a subset X of vertices, in this case, contains every...

Monophonic number | m-convexity number | m-convex set | Monophonic convexity | m-hull number | MATHEMATICS, APPLIED | NUMBER | SETS | GRAPHS

Monophonic number | m-convexity number | m-convex set | Monophonic convexity | m-hull number | MATHEMATICS, APPLIED | NUMBER | SETS | GRAPHS

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2019, Volume 37, Issue 2, pp. 546 - 562

A deadlock occurs in a distributed computation if a group of processes wait indefinitely for resources from each other. In this paper we study actions to be...

Deadlock recovery | Mathematics | Theory of Computation | Wait-for graphs | Knot | Computational complexity | Optimization | Vertex deletion | Convex and Discrete Geometry | Operations Research/Decision Theory | Directed feedback vertex set | Mathematical Modeling and Industrial Mathematics | Deadlock resolution | Combinatorics | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | EFFICIENT DETECTION | ALGORITHM | Hardness | Analysis | Algorithms

Deadlock recovery | Mathematics | Theory of Computation | Wait-for graphs | Knot | Computational complexity | Optimization | Vertex deletion | Convex and Discrete Geometry | Operations Research/Decision Theory | Directed feedback vertex set | Mathematical Modeling and Industrial Mathematics | Deadlock resolution | Combinatorics | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | EFFICIENT DETECTION | ALGORITHM | Hardness | Analysis | Algorithms

Journal Article

Annals of Operations Research, ISSN 0254-5330, 5/2018, Volume 264, Issue 1, pp. 267 - 286

Deadlock prevention techniques are essential in the design of robust distributed systems. However, despite the large number of different algorithmic approaches...

Deadlock | Business and Management | Operations Research/Decision Theory | And/or graphs | Graph convexity | Theory of Computation | Combinatorics | AND-OR model | NUMBER | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | SETS | COMPLEXITY | COMPUTATION | DISTRIBUTED SYSTEMS | SPLIT | Distributed processing (Computers) | Graph theory | Research | Mathematical research | Studies | Systems stability | Distributed processing | Operations research | Parameters | Systems design | Computation | Mathematical models | Computer networks | Convexity | Combinatorial analysis

Deadlock | Business and Management | Operations Research/Decision Theory | And/or graphs | Graph convexity | Theory of Computation | Combinatorics | AND-OR model | NUMBER | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | SETS | COMPLEXITY | COMPUTATION | DISTRIBUTED SYSTEMS | SPLIT | Distributed processing (Computers) | Graph theory | Research | Mathematical research | Studies | Systems stability | Distributed processing | Operations research | Parameters | Systems design | Computation | Mathematical models | Computer networks | Convexity | Combinatorial analysis

Journal Article

Annals of Operations Research, ISSN 0254-5330, 11/2017, Volume 258, Issue 2, pp. 781 - 814

The NP-hard Bicluster Editing Problem (BEP) consists of editing a minimum number of edges of an input bipartite graph G in order to transform it into a...

Clustering problem | Metaheuristic | Business and Management | Operations Research/Decision Theory | Theory of Computation | Bicluster Editing Problem | Combinatorics | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Mathematical analysis | Methods | Operations research | Heuristic methods | Editing | Data structures | Graph theory | Data mining | Gene expression | Empirical analysis | Studies | Reduction | Graphs | Computing time | Heuristic

Clustering problem | Metaheuristic | Business and Management | Operations Research/Decision Theory | Theory of Computation | Bicluster Editing Problem | Combinatorics | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Mathematical analysis | Methods | Operations research | Heuristic methods | Editing | Data structures | Graph theory | Data mining | Gene expression | Empirical analysis | Studies | Reduction | Graphs | Computing time | Heuristic

Journal Article

Journal of Network and Computer Applications, ISSN 1084-8045, 08/2016, Volume 71, pp. 118 - 129

Given a connected region in two-dimensional space where events of a certain kind occur according to a certain time-varying density, we consider the problem of...

Sensor networks | Distributed optimization | Autonomous agents | Mobile agents | Cooperative control | COMPUTER SCIENCE, SOFTWARE ENGINEERING | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | COVERAGE | SMART-DUST | EXPLORATION | SENSORS | Algorithms

Sensor networks | Distributed optimization | Autonomous agents | Mobile agents | Cooperative control | COMPUTER SCIENCE, SOFTWARE ENGINEERING | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | COVERAGE | SMART-DUST | EXPLORATION | SENSORS | Algorithms

Journal Article

Annals of Operations Research, ISSN 0254-5330, 12/2014, Volume 223, Issue 1, pp. 155 - 171

For a set $$W$$ W of vertices of a connected graph $$G=(V(G),E(G))$$ G = ( V ( G ) , E ( G ) ) , a Steiner W-tree is a connected subgraph $$T$$ T of $$G$$ G...

Enumerative combinatorics | Steiner tree | Operations Research/Decision Theory | Complexity of algorithms | Theory of Computation | Steiner convexity | Combinatorics | Economics / Management Science | DISTANCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MINIMAL-TREES | POLYNOMIAL-SPACE | GRAPHS | Trees (Graph theory) | Convex functions | Algorithms | Combinatorial enumeration problems | Research | Mathematical research | Studies | Operations research | Trees | Enumeration | Byproducts | Graphs | Polynomials | Terminals | Delay | Optimization

Enumerative combinatorics | Steiner tree | Operations Research/Decision Theory | Complexity of algorithms | Theory of Computation | Steiner convexity | Combinatorics | Economics / Management Science | DISTANCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MINIMAL-TREES | POLYNOMIAL-SPACE | GRAPHS | Trees (Graph theory) | Convex functions | Algorithms | Combinatorial enumeration problems | Research | Mathematical research | Studies | Operations research | Trees | Enumeration | Byproducts | Graphs | Polynomials | Terminals | Delay | Optimization

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 12/2017, Volume 704, pp. 92 - 93

In this corrigendum we give a counterexample to Theorem 6 in Penso et al. (2015) [1]. A polynomial time algorithm to determine the P3-hull number of a graph...

[formula omitted]-hull number | Subcubic graphs | [formula omitted]-hull set | Irreversible 2-conversion set | hull number | hull set

[formula omitted]-hull number | Subcubic graphs | [formula omitted]-hull set | Irreversible 2-conversion set | hull number | hull set

Journal Article

11.
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number

Discrete Applied Mathematics, ISSN 0166-218X, 08/2018, Volume 245, p. 94

Flood-It is a combinatorial problem on a colored graph whose aim is to make the graph monochromatic using the minimum number of flooding moves, relatively to a...

Trees | Numbers | Lower bounds | Leaves | Algorithms | Parameters | Upper bounds | Mathematics | Combinatorics | Flooding | Parameterization | Combinatorial analysis

Trees | Numbers | Lower bounds | Leaves | Algorithms | Parameters | Upper bounds | Mathematics | Combinatorics | Flooding | Parameterization | Combinatorial analysis

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 4, pp. 832 - 837

A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D . The geodetic...

Unit interval graph | Split graph | Convex hull | Geodetic number | Convex set | Cograph | MATHEMATICS | SETS | STEINER | PROPER

Unit interval graph | Split graph | Convex hull | Geodetic number | Convex set | Cograph | MATHEMATICS | SETS | STEINER | PROPER

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 11/2015, Volume 607, pp. 83 - 95

This paper studies new complexity aspects of P3-convexity restricted to planar graphs with bounded maximum degree. More specifically, we are interested in...

Parametrization | W-hard | FPT | NP-completeness

Parametrization | W-hard | FPT | NP-completeness

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2015, Volume 562, Issue C, pp. 406 - 418

For k≥1, we consider the graph dynamical system known as a k-reversible process. In such a process, each vertex in the graph has one of two possible states at...

Garden-of-Eden configurations | Graph dynamical systems | Predecessor-existence problem | k-Reversible processes | K-Reversible processes | CELLULAR-AUTOMATA | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Trees | Graphs | Polynomials | Dynamical systems | Counting

Garden-of-Eden configurations | Graph dynamical systems | Predecessor-existence problem | k-Reversible processes | K-Reversible processes | CELLULAR-AUTOMATA | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Trees | Graphs | Polynomials | Dynamical systems | Counting

Journal Article

European Journal of Operational Research, ISSN 0377-2217, 11/2016, Volume 254, Issue 3, p. 769

This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We...

Studies | Mathematical problems | Operations research | Manufacturing cells | Optimization algorithms | Mathematical functions | Graph algorithms

Studies | Mathematical problems | Operations research | Manufacturing cells | Optimization algorithms | Mathematical functions | Graph algorithms

Journal Article

16.
Full Text
Closure of genomic sets: applications of graph convexity to genome rearrangement problems

Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 08/2018, Volume 69, pp. 285 - 292

Genome rearrangement problems aim at finding the minimum number of mutational events required to transform a genome into another. Studying such problems from a...

Hamming distance | Cayley distance | Genome rearrangement | graph convexity | Genetic research | Genomics | Phylogeny

Hamming distance | Cayley distance | Genome rearrangement | graph convexity | Genetic research | Genomics | Phylogeny

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 18, pp. 5668 - 5674

Let G be a graph. If u , v ∈ V ( G ) , a u – v shortest path of G is a path linking u and v with minimum number of edges. The closed interval I [ u , v ]...

Algorithms | Geodesics | Cographs | Convexity | Hull number | Unit interval graphs | Complexity | MATHEMATICS | Computer science | Boats and boating

Algorithms | Geodesics | Cographs | Convexity | Hull number | Unit interval graphs | Complexity | MATHEMATICS | Computer science | Boats and boating

Journal Article

International Transactions in Operational Research, ISSN 0969-6016, 09/2019, Volume 26, Issue 5, pp. 1868 - 1883

The minimum coloring cut problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose...

combinatorial optimization | variable neighborhood search | label cut problem | minimum coloring cut problem | graph theory | Label cut problem | Minimum coloring cut problem | Graph theory | Combinatorial optimization | Variable neighborhood search | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | Algorithms | Coloring | Operations research | Graph coloring

combinatorial optimization | variable neighborhood search | label cut problem | minimum coloring cut problem | graph theory | Label cut problem | Minimum coloring cut problem | Graph theory | Combinatorial optimization | Variable neighborhood search | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | Algorithms | Coloring | Operations research | Graph coloring

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2018, Volume 245, p. 77

An f-reversible process on a graph G = (V, E) is a graph dynamical system on V (G) defined as follows. Given a function f : V(G) → N and an initial vertex...

Algorithms | Energy | Upper bounds | Time functions | Graphs | Graph theory | Trees (mathematics) | Configurations | Dynamical systems

Algorithms | Energy | Upper bounds | Time functions | Graphs | Graph theory | Trees (mathematics) | Configurations | Dynamical systems

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2013, Volume 469, pp. 15 - 23

A cycle transversal (or feedback vertex set) of a graph G is a subset T⊆V(G) such that T∩V(C)≠0̸ for every cycle C of G. This work considers the problem of...

Cographs | Cycle transversals | Perfect graphs | Feedback vertex set | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | PARTITION | CLIQUES

Cographs | Cycle transversals | Perfect graphs | Feedback vertex set | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | PARTITION | CLIQUES

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.