X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (46) 46
computer science (29) 29
mathematics, applied (16) 16
computer science, information systems (14) 14
computer science, theory & methods (14) 14
graphs (14) 14
algorithm analysis and problem complexity (11) 11
graph algorithms (11) 11
studies (11) 11
algorithm (10) 10
domination (10) 10
discrete mathematics in computer science (9) 9
interval graphs (9) 9
data structures (8) 8
applied mathematics (7) 7
chordal graphs (7) 7
distance-hereditary graphs (7) 7
hamiltonian cycle (7) 7
path cover (7) 7
computer graphics (6) 6
discrete mathematics and combinatorics (6) 6
information processing (6) 6
interval-graphs (6) 6
mathematical models (6) 6
optimization (6) 6
recognition (6) 6
computer communication networks (5) 5
evolutionary tree (5) 5
linear-time algorithm (5) 5
mathematics (5) 5
social networks (5) 5
theoretical computer science (5) 5
theory of computation (5) 5
approximation algorithm (4) 4
block graphs (4) 4
cographs (4) 4
mathematical analysis (4) 4
numeric computing (4) 4
permutation graphs (4) 4
probe graphs (4) 4
strongly chordal graphs (4) 4
topology (4) 4
trees (4) 4
bounded-degree-1 set (3) 3
branch and reduce (3) 3
branch-and-reduce algorithms (3) 3
circular-arc graphs (3) 3
cocomparability graphs (3) 3
cubic graphs (3) 3
design of algorithms (3) 3
fixed-parameter algorithm (3) 3
hamiltonian path (3) 3
index medicus (3) 3
log n) algorithm (3) 3
mathematical & computational biology (3) 3
measure-and-conquer (3) 3
models, biological (3) 3
modular decomposition (3) 3
operations research & management science (3) 3
path (3) 3
perfect domination (3) 3
set (3) 3
transitive orientation (3) 3
treewidth (3) 3
algorithmic aspects (2) 2
analysis (2) 2
approximation (2) 2
binary search trees (2) 2
biochemical research methods (2) 2
biochemical systems (2) 2
biology (2) 2
biotechnology & applied microbiology (2) 2
bipartite graphs (2) 2
branch and bound (2) 2
certifying algorithms (2) 2
chordal graph (2) 2
clique-width (2) 2
cohesion (2) 2
complexity (2) 2
computation (2) 2
computation by abstract devices (2) 2
computational mathematics and numerical analysis (2) 2
computer simulation (2) 2
data processing (2) 2
disjoint paths (2) 2
disjoint set union (2) 2
domatic partition (2) 2
dominating set (2) 2
dominating sets (2) 2
editing (2) 2
evolutionary (2) 2
exact algorithm (2) 2
fermentation (2) 2
graph theory (2) 2
inferring evolutionary trees (2) 2
interval (2) 2
investigations (2) 2
kernel (2) 2
leaf-labeled tree (2) 2
linear-time algorithms (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 39, pp. 5351 - 5373
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be... 
Interval graphs | Path cover | Circular-arc graphs | Hamiltonian cycle | Certifying algorithms | INTERVAL-GRAPHS | SET | RECOGNITION | PATH COVER PROBLEM | QUERY | LOG N) ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | LINEAR-TIME ALGORITHMS | Algorithms | Graphs | Circularity | Complexity
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2011, Volume 412, Issue 23, pp. 2496 - 2502
Let G be a class of graphs. A graph G has G-width k if there are k independent sets N1,…,Nk in G such that G can be embedded into a graph H∈G such that for... 
Parameterized algorithms | Probe graphs | Block graphs | COMPUTER SCIENCE, THEORY & METHODS | VERTEX-MINORS | Blocking | Graphs | C (programming language)
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 18, pp. 4185 - 4204
Journal Article
SIAM journal on computing, ISSN 1095-7111, 1998, Volume 27, Issue 6, pp. 1671 - 1694
... PROBLEMS ON INTERVAL AND CIRCULAR-ARC GRAPHS MAW-SHANG CHANG Abstract. This paper rst presents a unied approach to design e cient algorithms for the weighted... 
Domination | Interval graphs | Circular-arc graphs | Graph algorithms | MATHEMATICS, APPLIED | domination | DISJOINT SET UNION | RECOGNITION | circular-arc graphs | LINEAR-TIME ALGORITHM | OPTIMAL PARALLEL ALGORITHMS | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | VERTICES | interval graphs | graph algorithms
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2006, Volume 154, Issue 3, pp. 525 - 536
In this paper, we show that the clique-transversal number τ C ( G ) and the clique-independence number α C ( G ) are equal for any distance-hereditary graph G.... 
Graphs | Clique-independence number | Distance-hereditary graphs | Clique-transversal number | distance-hereditary graphs | ALGORITHMIC ASPECTS | MATHEMATICS, APPLIED | graphs | TRANSVERSAL | clique-transversal number | SETS | CHORDAL GRAPHS | clique-independence number | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2005, Volume 341, Issue 1, pp. 411 - 440
A Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once. A Hamiltonian cycle of a graph is a simple cycle with the same... 
Graph algorithms | Hamiltonian problems | Linear-time algorithms | Distance-hereditary graphs | distance-hereditary graphs | PATH | linear-time algorithms | COCOMPARABILITY GRAPHS | DOMINATION | CLIQUE-WIDTH | TREE | COMPUTER SCIENCE, THEORY & METHODS | CIRCUIT PROBLEM | graph algorithms | CYCLE | Computer science | Algorithms
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 10/2011, Volume 49, Issue 3, pp. 576 - 587
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 8/2010, Volume 47, Issue 2, pp. 342 - 367
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 12, pp. 2611 - 2619
Given a class of graphs G , a graph G is a probe graph of G if its vertices can be partitioned into two sets, P , the probes, and an independent set N , the... 
Weakly chordal graphs | Modular decomposition | Permutation graphs | Minimum fill-in | Probe graphs | Treewidth | INTERVAL-GRAPHS | MATHEMATICS, APPLIED | ALGORITHM | CHORDAL GRAPHS | SLIM GRAPHS | TRANSITIVE ORIENTATION | Computer science | Investigations | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2008, Volume 396, Issue 1, pp. 212 - 222
Given a class of graphs G , a graph G is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such... 
Graph recognition algorithms | Permutation graphs | Cocomparability graphs | Comparability graphs | Probe graphs | RECOGNITION | probe graphs | cocomparability graphs | ALGORITHM | graph recognition algorithms | COMPUTER SCIENCE, THEORY & METHODS | comparability graphs | TRANSITIVE ORIENTATION | MODULAR DECOMPOSITION | permutation graphs
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2018, Volume 251, pp. 114 - 125
A bounded-degree-1 set S in an undirected graph G=(V,E) is a vertex subset such that the maximum degree of G[S] is at most one. Given a graph G, the Maximum... 
Vertex cover P3 | 2-plex | Exact algorithm | Approximation algorithm | Bounded-degree-1 set | MATHEMATICS, APPLIED | KERNEL | 3-PATH VERTEX COVER | MODEL | Algorithms | Run time (computers) | Approximations | Social networks | Set theory | Graph theory | Polynomials
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 1997, Volume 80, Issue 2, pp. 135 - 148
It is shown in this paper that the weighted domination problem and its three variants, the weighted connected domination, total domination, and dominating... 
PERFECT DOMINATION | MATHEMATICS, APPLIED | HAMILTONIAN CYCLE | POLYNOMIAL ALGORITHMS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2002, Volume 116, Issue 1, pp. 103 - 113
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in... 
Domination | Leaf | Labeling | Distance-hereditary graph | Neighborhood | Twin | CONNECTED DOMINATION | MATHEMATICS, APPLIED | domination | labeling | R-DOMINATION | neighborhood | leaf | distance-hereditary graph | twin | STEINER TREES
Journal Article
2014 International Computer Science and Engineering Conference (ICSEC), 07/2014, pp. 12 - 17
Given a graph G = (V, E), a P 2 -packing P is a collection of vertex disjoint copies of P 2 s in G where a P 2 is a simple path with three vertices and two... 
Computer science | Algorithm design and analysis | P 2 -packing | net-free graphs | Particle separators | kernelization algorithm | Educational institutions | Polynomials | Bipartite graph | Kernel | packing | Net-free graphs | Kernelization algorithm
Conference Proceeding
Information Processing Letters, ISSN 0020-0190, 1995, Volume 56, Issue 3, pp. 165 - 171
An edge dominating set D of graph G = ( V, E) is a set of edges such that every edge not in D is adjacent to at least one edge in D. We develop polynomial time... 
Bipartite permutation graphs | Algorithms | Graph algorithms | Edge domination
Journal Article
Smart Innovation, Systems and Technologies, ISSN 2190-3018, 11/2013, Volume 29, Issue 6, pp. 1109 - 142
In this paper, we study the problem Min-Max 2-Cluster Editing which asks for a modification of a given graph into two maximal cliques by inserting or deleting... 
Clustering editing | NP-hard | Approximation algorithm | Algorithm | Graph modification problem | Approximation Algorithm | GRAPH MODIFICATION PROBLEMS | approximation algorithm | COMPUTER SCIENCE, INFORMATION SYSTEMS | GENERATION | graph modification problem | ALGORITHMS | clustering editing | algorithm
Conference Proceeding
Discrete Applied Mathematics, ISSN 0166-218X, 1997, Volume 78, Issue 1, pp. 41 - 50
This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs. 
Domination | Interval graphs | Graph algorithms | Intersection of minimum dominating sets | MATHEMATICS, APPLIED | domination | intersection of minimum dominating sets | PROPERTY | LINEAR-TIME ALGORITHM | interval graphs | graph algorithms
Journal Article
No results were found for your search.

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