X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (41) 41
graphs (23) 23
computer science (18) 18
computer science, theory & methods (16) 16
mathematics, applied (15) 15
studies (15) 15
computer science, information systems (14) 14
mathematics (14) 14
computational complexity (13) 13
graph theory (13) 13
index medicus (13) 13
humans (12) 12
operations research & management science (12) 12
analysis (11) 11
female (10) 10
male (10) 10
algorithm (9) 9
complexity (9) 9
middle aged (9) 9
combinatorics (8) 8
discrete mathematics and combinatorics (8) 8
operations research (8) 8
adult (7) 7
critical care medicine (7) 7
helly property (7) 7
research (7) 7
aged (6) 6
cographs (6) 6
feedback vertex set (6) 6
graph algorithms (6) 6
hull number (6) 6
mathematical analysis (6) 6
mathematical models (6) 6
optimization (6) 6
risk factors (6) 6
theoretical computer science (6) 6
theory of computation (6) 6
air pollution (5) 5
anesthesiology (5) 5
applied mathematics (5) 5
computer networks (5) 5
computer science, hardware & architecture (5) 5
data structures (5) 5
epidemiology (5) 5
fpt (5) 5
graph (5) 5
hardness (5) 5
injury (5) 5
intensive / critical care medicine (5) 5
medicine & public health (5) 5
np-complete problems (5) 5
operations research/decision theory (5) 5
polynomials (5) 5
prospective studies (5) 5
sets (5) 5
trees (5) 5
acute respiratory distress syndrome (4) 4
care and treatment (4) 4
case-control studies (4) 4
chordal graphs (4) 4
combinatorial analysis (4) 4
combinatorial optimization (4) 4
comorbidity (4) 4
computation (4) 4
computer science - discrete mathematics (4) 4
convex hull (4) 4
convexity (4) 4
emergency medicine (4) 4
fixed-parameter tractability (4) 4
flood-it (4) 4
management (4) 4
mechanical ventilation (4) 4
model (4) 4
np-hardness (4) 4
pain medicine (4) 4
patient outcomes (4) 4
pediatrics (4) 4
pneumology/respiratory system (4) 4
respiratory system (4) 4
w-hard (4) 4
-graphs (3) 3
abridged index medicus (3) 3
algorithm analysis and problem complexity (3) 3
and/or graphs (3) 3
animals (3) 3
bicluster editing problem (3) 3
clique-helly graphs (3) 3
computer communication networks (3) 3
computer science - data structures and algorithms (3) 3
computer science, interdisciplinary applications (3) 3
convex set (3) 3
critically-ill patients (3) 3
cycle transversal (3) 3
cycle transversals (3) 3
deadlock resolution (3) 3
deadlock-problem (3) 3
discrete mathematics (3) 3
discrete mathematics in computer science (3) 3
editing (3) 3
engineering, electrical & electronic (3) 3
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
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
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
Journal Article
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
Journal Article
Annals of Operations Research, ISSN 0254-5330, 12/2014, Volume 223, Issue 1, pp. 155 - 171
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
Journal Article
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
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
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
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
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
Journal Article
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
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
Journal Article
International Transactions in Operational Research, ISSN 0969-6016, 09/2019, Volume 26, Issue 5, pp. 1868 - 1883
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
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
Journal Article
No results were found for your search.

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