X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
traceability (17) 17
mathematics (12) 12
computer science, software engineering (11) 11
computer science (8) 8
k-traceable (8) 8
mathematics, applied (8) 8
oriented graph (8) 8
traceability conjecture (8) 8
computer programs (7) 7
graphs (7) 7
software (7) 7
path partition conjecture (6) 6
software engineering (6) 6
analysis (5) 5
information retrieval (5) 5
longest path (5) 5
source code (5) 5
studies (5) 5
traceability recovery (5) 5
hamiltonicity (4) 4
leaf number (4) 4
links (4) 4
management (4) 4
programming languages, compilers, interpreters (4) 4
requirements traceability (4) 4
software engineering/programming and operating systems (4) 4
[formula omitted]-traceable (3) 3
agricultural economics & policy (3) 3
artifacts (3) 3
combinatorics (3) 3
computer science, information systems (3) 3
documentation (3) 3
economics (3) 3
empirical software engineering (3) 3
empirical studies (3) 3
engineering, electrical & electronic (3) 3
generalized tournament (3) 3
graph theory (3) 3
humanities and social sciences (3) 3
hypotraceable (3) 3
information (3) 3
information storage and retrieval (3) 3
minimum degree (3) 3
program comprehension (3) 3
requirements (3) 3
usage (3) 3
05c38 (2) 2
05c45 (2) 2
business (2) 2
business administration (2) 2
conceptual cohesion (2) 2
construction (2) 2
design (2) 2
developers (2) 2
discrete mathematics (2) 2
engineering design (2) 2
equivalence (2) 2
identification (2) 2
independent sets (2) 2
innovations (2) 2
knowledge (2) 2
labels (2) 2
large scale integration (2) 2
latent semantic indexing (2) 2
metrics (2) 2
partitions (2) 2
performance evaluation (2) 2
quality (2) 2
recovering traceability links (2) 2
semantics (2) 2
similarity (2) 2
simulation methods (2) 2
software quality (2) 2
spanning-trees (2) 2
strategy (2) 2
tournament (2) 2
traceable (2) 2
trees (2) 2
validation (2) 2
visualization (2) 2
willingness-to-pay (2) 2
05c20 (1) 1
2-hypohamiltonian (1) 1
2-hypotraceable (1) 1
[ shs.eco ] humanities and social sciences/economies and finances (1) 1
[ shs.gestion ] humanities and social sciences/business administration (1) 1
[shs.eco]humanities and social sciences/economies and finances (1) 1
abbreviations (1) 1
absorptive-capacity (1) 1
accuracy (1) 1
acronyms (1) 1
agribusiness (1) 1
agricultural industry (1) 1
agricultural sciences (1) 1
agricultural traceability and tracking (1) 1
agriculture, economy and politics (1) 1
air pollution (1) 1
algebra (1) 1
animal husbandry (1) 1
animal welfare (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Electronic Journal of Combinatorics, ISSN 1077-8926, 11/2015, Volume 22, Issue 4, pp. 1 - 8
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. An oriented graph is a digraph without 2-cycles. The... 
Oriented graph | Path Partition Conjecture | Generalized tournament | Traceability Conjecture | K-traceable | MATHEMATICS | MATHEMATICS, APPLIED | k-traceable
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2016, Volume 339, Issue 2, pp. 800 - 803
For k≥2, an oriented graph D of order at least k, is said to be k-traceable if any subset of k vertices of D induces a traceable oriented graph. The... 
Traceability conjecture | [formula omitted]-traceable | Girth | Oriented graph | Traceable oriented graph | k-traceable | MATHEMATICS
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 2013, Volume 20, Issue 1
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. The Traceability Conjecture (TC) states that for k >=... 
Longest path | Oriented graph | K-traceable | Traceability conjecture | Traceable | Path partition conjecture | Generalized tournament | MATHEMATICS | MATHEMATICS, APPLIED | longest path | Path Partition Conjecture | generalized tournament | k-traceable | Traceability Conjecture | traceable | oriented graph
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 12/2008, Volume 15, Issue 1, pp. 1 - 13
A (di)graph G of order n is k-traceable (for some k, 1 <= k <= n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac's degree... 
Longest path | Traceability conjecture | Path partition conjecture | Oriented graph | K-traceable | MATHEMATICS | MATHEMATICS, APPLIED | Path Partition Conjecture | k-traceable | Traceability Conjecture | oriented graph
Journal Article
Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 2008, Volume 10, Issue 3, pp. 105 - 114
A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceability Conjecture is that for k >= 2 every k-traceable oriented... 
Longest path | Nontraceable | Traceability conjecture | Path partition conjecture | Oriented graph | K-traceable | PATH | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | longest path | Path Partition Conjecture | nontraceable | k-traceable | Traceability Conjecture | oriented graph | Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2011, Volume 311, Issue 18, pp. 2085 - 2094
A digraph of order at least k is termed k - traceable if each of its subdigraphs of order k is traceable. It turns out that several properties of... 
Pancyclic digraph | Tournament | [formula omitted]-traceable | Oriented graph | Path Partition Conjecture | Traceability Conjecture | k-traceable | MATHEMATICS | CONJECTURE | Graphs | Partitions | Graph theory | Upper bounds | Moon | Mathematical analysis
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 7/2014, Volume 30, Issue 4, pp. 783 - 800
A digraph D of order n is r-hypohamiltonian (respectively r-hypotraceable) for some positive integer r < n − 1 if D is nonhamiltonian (nontraceable) and the... 
05C20 | hypohamiltonian | hypotraceable | Mathematics | Engineering Design | 2-hypohamiltonian | 2-hypotraceable | hypo-hypotraceable | Path Partition Conjecture | hypo-hypohamiltonian | Combinatorics | Traceability Conjecture | 05C38 | MATHEMATICS | DIGRAPHS | Graphs | Integers | Partitions | Construction | Deletion | Graph theory | Joints | Combinatorial analysis
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 8, pp. 1325 - 1333
A digraph of order at least k is k -traceable if each of its subdigraphs of order k is traceable. We note that 2-traceable oriented graphs are tournaments and... 
Longest path | Oriented graph | Hypotraceable | Traceable | Traceability conjecture | [formula omitted]-traceable | Generalized tournament | k-traceable | MATHEMATICS | INDEPENDENT SETS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 278 - 282
The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLaviña, state that every simple connected graph G with minimum degree δ... 
Traceable graphs | Minimum degree | Leaf number | MATHEMATICS, APPLIED | TREES | LONGEST CYCLES | TRACEABILITY | Graffiti | Graphs | Personal computers
Journal Article
Czechoslovak Mathematical Journal, ISSN 0011-4642, 6/2013, Volume 63, Issue 2, pp. 539 - 545
Let G be a finite connected graph with minimum degree δ. The leaf number L(G) of G is defined as the maximum number of leaf vertices contained in a spanning... 
05C45 | Mathematics | traceability | graph | leaf number | Ordinary Differential Equations | interconnection network | Analysis | Convex and Discrete Geometry | Hamiltonicity | Mathematics, general | Graffiti.pc | Mathematical Modeling and Industrial Mathematics | MATHEMATICS | Graffiti. pc | SPANNING-TREES | GRAPHS | Computer science
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2013, Volume 161, Issue 13-14, pp. 2217 - 2222
Let G be a simple connected graph with minimum degree δ. Then G is Hamiltonian if it contains a spanning cycle and traceable if it contains a spanning path.... 
Traceability | Centralized terminal network | Minimum degree | Hamiltonicity | Leaf number | MATHEMATICS, APPLIED | NUMBER | LEAVES | Trees | Graphs | Mathematical models | Graph theory | Computer programs
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 11/2013, Volume 20, Issue 4
A digraph D is traceable if it contains a path visiting every vertex, and hypotraceable if D is not traceable, but D - v is traceable for every vertex v is an... 
Traceability | Tournament | Oriented graph | Hypotraceable | K-traceable | MATHEMATICS | MATHEMATICS, APPLIED | TRAVELING SALESMAN POLYTOPE | hypotraceable | TOURNAMENTS | LONGEST PATH | FACETS | tournament | traceability | k-traceable | INDEPENDENT SETS | oriented graph
Journal Article
Preventive Veterinary Medicine, ISSN 0167-5877, 09/2017, Volume 144, pp. 89 - 101
Journal Article
ACTA MATHEMATICA HUNGARICA, ISSN 0236-5294, 06/2017, Volume 152, Issue 1, pp. 217 - 226
We prove a new sufficient condition for a connected graph to be Hamiltonian in terms of the leaf number and the minimum degree. Our results give solutions to... 
leaf number | MATHEMATICS | Hamiltonicity | CYCLES | minimum degree | SPANNING-TREES | traceability | GRAPHS
Journal Article
Geostandards and Geoanalytical Research, ISSN 1639-4488, 03/2018, Volume 42, Issue 1, pp. 91 - 96
A properly developed consensus from a proficiency test is, for all practical purposes, interchangeable with a certified value derived from an interlaboratory... 
consensus | certified reference material | traceability | uncertainty | proficiency test | bias | GEOCHEMISTRY & GEOPHYSICS | Procedures | Reference materials | Stability | Materials
Journal Article
Agribusiness, ISSN 0742-4477, 2011, Volume 27, Issue 3, pp. 379 - 397
This paper aims to understand what factors influence firms to adopt electronic traceability systems (ETS) and notably the respective effects of the firm's... 
FOOD-INDUSTRY | INFORMATIONAL CASCADES | MANAGEMENT | NETWORK EXTERNALITIES | PERSPECTIVE | AGRICULTURAL ECONOMICS & POLICY | FOOD SCIENCE & TECHNOLOGY | COORDINATION | DIFFUSION | ECONOMICS | ICT | PROCESS TECHNOLOGIES | Agricultural industry | Technology application | Usage | Management | Information technology | Economics and Finance | Humanities and Social Sciences
Journal Article
2012 28th IEEE International Conference on Software Maintenance (ICSM), ISSN 1063-6773, 09/2012, pp. 191 - 200
Requirements traceability (RT) links help developers to understand programs and ensure that their source code is consistent with its documentation. Creating RT... 
Visualization | Java | Software maintenance | Accuracy | Requirements traceability | LSI | Conferences | eye tracking | source code | LDA | Information retrieval | Large scale integration
Conference Proceeding
No results were found for your search.

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