X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
interval graphs (320) 320
algorithms (310) 310
mathematics, applied (265) 265
interval graph (241) 241
interval-graphs (166) 166
graphs (164) 164
computer science (158) 158
mathematics (140) 140
computer science, theory & methods (127) 127
algorithm (84) 84
computer science, information systems (83) 83
complexity (81) 81
intervals (75) 75
discrete mathematics and combinatorics (73) 73
recognition (63) 63
computer science, software engineering (56) 56
applied mathematics (53) 53
chordal graphs (51) 51
graph theory (51) 51
graph algorithms (50) 50
operations research & management science (47) 47
theoretical computer science (47) 47
theory of computation (47) 47
circular-arc graphs (46) 46
mathematical analysis (46) 46
proper interval graphs (44) 44
algorithm analysis and problem complexity (41) 41
analysis (41) 41
proper interval graph (40) 40
unit interval graph (38) 38
optimization (37) 37
trees (37) 37
permutation graphs (36) 36
domination (34) 34
approximation algorithms (33) 33
computer science, hardware & architecture (33) 33
unit interval graphs (31) 31
discrete mathematics (30) 30
bandwidth (29) 29
chordal graph (29) 29
intersection graph (29) 29
mathematics of computing (29) 29
combinatorics (28) 28
scheduling (28) 28
mathematical models (27) 27
polynomials (27) 27
tree (26) 26
coloring (24) 24
computer systems organization and communication networks (24) 24
computer science, interdisciplinary applications (23) 23
data structures, cryptology and information theory (23) 23
parallel algorithms (23) 23
studies (23) 23
data structures and algorithms (22) 22
design of algorithms (22) 22
engineering, electrical & electronic (22) 22
graph coloring (22) 22
mathematics - combinatorics (22) 22
區間圖 (22) 22
approximation (21) 21
computational complexity (20) 20
computer science - discrete mathematics (20) 20
linear-time recognition (20) 20
computation (19) 19
np-completeness (19) 19
number (19) 19
pathwidth (19) 19
treewidth (19) 19
analysis of algorithms (18) 18
circular-arc graph (18) 18
intersection graphs (18) 18
operations research (18) 18
parameterized complexity (18) 18
strongly chordal graphs (18) 18
[ info.info-ds ] computer science [cs]/data structures and algorithms [cs.ds] (17) 17
boxicity (17) 17
cocomparability graphs (17) 17
representations (17) 17
approximation algorithm (16) 16
discrete mathematics in computer science (16) 16
cographs (15) 15
dynamic programming (15) 15
graph (15) 15
networks (15) 15
permutations (15) 15
planar graphs (15) 15
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (14) 14
clique-width (14) 14
computational theory and mathematics (14) 14
computer science - data structures and algorithms (14) 14
graph classes (14) 14
operations research/decision theory (14) 14
perfect graphs (14) 14
proper (14) 14
set (14) 14
split graphs (14) 14
time (14) 14
bipartite graphs (13) 13
combinatorial problems (13) 13
data structures (13) 13
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, 08/2018, Volume 245, pp. 168 - 176
We study those unit interval graphs having a model with intervals of integer endpoints and prescribed length. We present a structural result for this graph... 
Unit interval graphs | Forbidden induced subgraphs | Proper interval graphs | MATHEMATICS, APPLIED | Analysis | Algorithms
Journal Article
Discrete Mathematics, ISSN 0012-365X, 11/2015, Volume 338, Issue 11, pp. 1907 - 1916
A perfect graph is a graph every subgraph of which has a chromatic number equal to its clique number (Berge, 1963; Lovász, 1972). A (vertex) weighted graph is... 
Superperfect graphs | Unit interval graphs | Proper interval graphs | MATHEMATICS | Algorithms
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2013, Volume 229, Issue 2, pp. 332 - 344
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 78 - 92
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that... 
Interval graphs | Proper thinness | Thinness | Proper interval graphs | MINORS | MATHEMATICS, APPLIED | NUMBER | BOUNDS | COMPLEXITY | DOMINATION | ALGORITHMS | Graphs | Polynomials
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 08/2015, Volume 79, Issue 4, pp. 267 - 281
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2017, Volume 222, pp. 151 - 165
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity)... 
Unit interval graph | Lex-BFS | Seriation | Straight enumeration | Robinson (dis)similarity | Partition refinement | PROPER INTERVAL-GRAPHS | MATHEMATICS, APPLIED | Algorithms
Journal Article
Journal of Complex Networks, ISSN 2051-1310, 2016, Volume 4, Issue 2, pp. 224 - 244
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 11/2015, Volume 195, pp. 2 - 7
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interval representation whose lengths deviate from one. We... 
Interval graph | Unit interval graph | Comparability invariant | Intersection graph | MATHEMATICS, APPLIED | UNIT | PROPER
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 04/2015, Volume 576, Issue 1, pp. 85 - 101
Chordal graphs are intersection graphs of subtrees of a tree T. We investigate the complexity of the partial representation extension problem for chordal... 
Interval graph | Chordal graph | Restricted representation | Intersection representation | Partial representation extension | INTERVAL-GRAPHS | RECOGNITION | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | Trees | Intervals | Subdivisions | Equivalence | Graphs | Representations | Topology | Complexity
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 216, pp. 67 - 83
A normal Helly circular-arc graph is the intersection graph of a set of arcs on a circle of which no three or less arcs cover the whole circle. Lin et al.... 
Holes | Linear-time | (proper) interval graphs | (minimal) forbidden induced subgraphs | Chordal graphs | (normal, Helly, proper) circular-arc models | Certifying algorithms | INTERVAL-GRAPHS | MATHEMATICS, APPLIED | RECOGNITION | SUBCLASSES | ALGORITHMS | Algorithms
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2011, Volume 40, Issue 5, pp. 1292 - 1315
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2018, Volume 32, Issue 1, pp. 148 - 172
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 10755, pp. 8 - 19
Conference Proceeding
Algorithmica, ISSN 0178-4617, 4/2019, Volume 81, Issue 4, pp. 1490 - 1511
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2019, Volume 267, pp. 52 - 63
A poset P=(X,≺) has an interval representation if each x∈X can be assigned a real interval Ix so that x≺y in P if and only if Ix lies completely to the left of... 
Interval order | Interval graph | Semiorder | MATHEMATICS, APPLIED | GRAPHS | Set theory | Polynomials | Representations | Weight
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 260, pp. 256 - 261
For a graph G and an integer-valued threshold function τ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it... 
Interval graph | Dynamic monopoly | Target set selection | MATHEMATICS, APPLIED | Monopolies | Graphs | Polynomials | Apexes | Mathematical analysis
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2020, Volume 806, pp. 197 - 218
We investigate for temporal graphs the computational complexity of separating two distinct vertices s and z by vertex deletion. In a temporal graph, the vertex... 
Temporal paths | Dynamic programming | Temporal restrictions | Fixed-parameter tractability | Unit interval graphs | NP-completeness | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 07/2018, Volume 14, Issue 3, pp. 1 - 62
In the I nterval C ompletion problem we are given an n -vertex graph G and an integer k , and the task is to transform G by making use of at most k edge... 
completion problems | interval graphs | Subexponential algorithms | graph modification problems
Journal Article
Information Processing Letters, ISSN 0020-0190, 06/2019, Volume 146, pp. 27 - 29
•The eternal domination and clique-connected cover numbers coincide for interval graphs.•The previous proof of this fact for proper interval graphs is greatly... 
Interval graphs | Combinatorial problems | Eternal dominating set | Neocolonization | COMPUTER SCIENCE, INFORMATION SYSTEMS | Algorithms
Journal Article
09/2017
Involve 11 (2018) 893-900 A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in... 
Mathematics - Combinatorics
Journal Article
No results were found for your search.

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