X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
otorhinolaryngology (8) 8
mathematics (4) 4
analysis (3) 3
combinatorics (3) 3
complexity (3) 3
computer science (3) 3
discrete mathematics (3) 3
ginkgo biloba (3) 3
agronomy (2) 2
algorithms (2) 2
audição (2) 2
autonomous (2) 2
citoproteção (2) 2
compostos organofosforados (2) 2
computational complexity (2) 2
computer science - computational geometry (2) 2
computer science, artificial intelligence (2) 2
computer science, theory & methods (2) 2
corn (2) 2
cytoprotection (2) 2
dizziness (2) 2
electrophysiology (2) 2
eletrofisiologia (2) 2
environment (2) 2
feedback vertex set (2) 2
genotypes (2) 2
grain yield (2) 2
graphs (2) 2
hearing (2) 2
heterosis (2) 2
inbred lines (2) 2
independent sets (2) 2
italian language (2) 2
language & linguistics (2) 2
maize (2) 2
np-completeness (2) 2
organophosphorus compounds (2) 2
robotics (2) 2
robotics industry (2) 2
robots (2) 2
syntax (2) 2
tontura (2) 2
toxicidade (2) 2
toxicity (2) 2
triangle graphs (2) 2
triangle packing and transversal (2) 2
vc-dimension (2) 2
vertigem (2) 2
vertigo (2) 2
1900-1999 (1) 1
3-mode pattern-analysis (1) 1
[formula omitted]-bounded (1) 1
[formula omitted]-complete (1) 1
[formula omitted]-completeness (1) 1
[formula omitted]-connected (1) 1
abruzzo earthquake (1) 1
accuracy (1) 1
adolescent (1) 1
adult (1) 1
aged (1) 1
aged, 80 and over (1) 1
algorithm (1) 1
ambient intelligence (1) 1
animals (1) 1
anthesis-silking interval (1) 1
approximation (1) 1
approximation hardness (1) 1
artificial intelligence (1) 1
assisted living (1) 1
assisted living facilities (1) 1
audiometry, pure-tone (1) 1
aufsatzsammlung (1) 1
automation & control systems (1) 1
autonomes system (1) 1
autonomous robots (1) 1
benincà, paola (1) 1
bildfrequenz (1) 1
biomass (1) 1
boundary class (1) 1
boundary classes (1) 1
bounded clique-width (1) 1
bounded degree graphs (1) 1
bounded mim-width (1) 1
brain (1) 1
camera network (1) 1
cancer (1) 1
case-control studies (1) 1
cervical cancer, gstm1, gstt1, smoking (1) 1
chemisches grundverfahren (1) 1
chi $$ χ -bounded (1) 1
ciencias da saude (1) 1
cisplatin ototoxicity (1) 1
clauses (1) 1
claw (1) 1
clique cover (1) 1
clique-width (1) 1
clustering (1) 1
cochlea - drug effects (1) 1
cochlea - ultrastructure (1) 1
completeness (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Theoretical Computer Science, ISSN 0304-3975, 09/2017, Volume 692, pp. 46 - 71
We continue the study of boundary classes for NP-hard problems and focus on seven NP-hard graph problems involving non-local properties: Hamiltonian Cycle,... 
Boundary class | Hamiltonian cycle | Feedback vertex set | Computational complexity | Hereditary class | DIMENSION | ALGORITHM | WIDTH | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les restrictions aux sous-classes des hypergraphes permettent... 
Line graphs | Graphes | Paramètre des hypergraphes | Hypergraph parameters | 004 | Theta-bounding functions | NP-completeness | Boundary classes | VC-dimension | NP-complétude
Dissertation
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, Issue 1, pp. 163 - 174
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, pp. 163 - 174
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its kk-connected subgraphs. In particular, we... 
Lower bounds | Computation | Images | Graphs | Mathematical models
Journal Article
5. Full Text The VC-dimension of graphs with respect to
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, pp. 163 - 174
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 7/2018, Volume 34, Issue 4, pp. 647 - 668
... Andrea Munaro 1 Received: 10 December 2016 / Revised: 17 April 2018 / Published online: 19 May 2018 © Springer Japan KK, part of Springer Nature 2018 Abstract Tuza’s... 
Triangle packing and transversal | chi $$ χ -Bounded | Triangle graphs | Mathematics | Engineering Design | Combinatorics
Journal Article
Graphs and combinatorics, ISSN 1435-5914, 2018, Volume 34, Issue 4, pp. 647 - 668
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 07/2018, Volume 34, Issue 4, pp. 647 - 668
To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s00373-018-1903-y Tuza's... 
Triangle graphs | Triangle packing and transversal | χ-Bounded
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 11282, pp. 317 - 330
Conference Proceeding
Graphs and combinatorics, ISSN 0911-0119, 01/2018, Volume 34, Issue 4, pp. 647 - 668
Tuza’s Conjecture asserts that the minimum number τΔ′(G) of edges of a graph G whose deletion results in a triangle-free graph is at most 2 times the maximum... 
Triangles | Diamonds | Deletion | Graphs | Graph theory
Journal Article
Discrete Mathematics, ISSN 0012-365X, 09/2017, Volume 340, Issue 9, pp. 2208 - 2216
We show that f(x)=⌊32x⌋ is a θ-bounding function for the class of subcubic graphs and that it is best possible. This generalizes a result by Henning et al.... 
[formula omitted]-bounded | PTAS | Clique cover | Bounded degree graphs | θ-bounded | MATHEMATICS | theta-bounded | OPTIMIZATION PROBLEMS | APPROXIMATION | COMPLEXITY | INDEPENDENT SETS | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2017, Volume 340, Issue 6, pp. 1210 - 1226
Line graphs constitute a rich and well-studied class of graphs. In this paper, we focus on three different topics related to line graphs of subcubic... 
Min-max theorems | [formula omitted]-completeness | Line graph | Approximation hardness | Independence number | Matching number | NP-completeness | CLAW | RATIO | MATCHINGS | HAMILTONIAN PATH PROBLEM | INDEPENDENT SETS | FEEDBACK VERTEX SET | MATHEMATICS | K-4)-FREE 4-REGULAR GRAPHS | CYCLES | PLANAR GRAPHS | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, pp. 163 - 174
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its k-connected subgraphs. In particular, we give... 
[formula omitted]-complete | VC-dimension | [formula omitted]-connected | NP-complete | k-connected | MATHEMATICS, APPLIED | BOUNDED CLIQUE-WIDTH | COMPLEXITY | Venture capital
Journal Article
04/2020
We consider Independent Set and Dominating Set restricted to VPG graphs (or, equivalently, string graphs). We show that they both remain $\mathsf{NP}$-hard on... 
Journal Article
Theoretical computer science, ISSN 0304-3975, 2020, Volume 814, pp. 28 - 48
A semitotal dominating set of a graph G with no isolated vertex is a dominating set D of G such that every vertex in D is within distance two of another vertex... 
Total Dominating Set | Dually chordal graphs | Bounded mim-width | Semitotal Dominating Set | Computational complexity | SET | COMPLEXITY | CLIQUE-WIDTH | TREE | COMPLETENESS | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Il Verri: Rivista di Letteratura, ISSN 0506-7715, 1990, Volume 1-2, p. 153
Journal Article
2003, Oxford studies in comparative syntax., ISBN 0195136462, xiv, 255
Book
Il Verri, ISSN 0506-7715, 03/1990, Issue 1, p. 153
Journal Article
08/2020
A colouring of a graph $G=(V,E)$ is a mapping $c\colon V\to \{1,2,\ldots\}$ such that $c(u)\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The... 
Journal Article
02/2013
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we... 
Journal Article
No results were found for your search.

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