X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics, applied (7) 7
algorithms (5) 5
cacti (5) 5
computer science (5) 5
graphs (5) 5
mathematics (5) 5
complexity (4) 4
combinatorics (3) 3
discrete mathematics (3) 3
graph theory (3) 3
np-complete (3) 3
prisms (3) 3
theory of computation (3) 3
algorithm analysis and problem complexity (2) 2
applied mathematics (2) 2
approximation algorithm (2) 2
asymmetric tsp (2) 2
cactus (2) 2
cactus representation (2) 2
computer science, software engineering (2) 2
computer science, theory & methods (2) 2
computer systems organization and communication networks (2) 2
data structures, cryptology and information theory (2) 2
directed cacti (2) 2
fast algorithm (2) 2
graph orientation (2) 2
halin graphs (2) 2
mathematics of computing (2) 2
planar graph (2) 2
spanning cacti (2) 2
1)-labeling (1) 1
[ info ] computer science [cs] (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[ math.math-co ] mathematics [math]/combinatorics [math.co] (1) 1
[formula omitted]-labeling (1) 1
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (1) 1
[info]computer science [cs] (1) 1
[math.math-co]mathematics [math]/combinatorics [math.co] (1) 1
acyclic (1) 1
acyclic colorings (1) 1
arbitrary topology (1) 1
arboricity (1) 1
arc colouring (1) 1
arc-colouring (1) 1
beräkningsmatematik (1) 1
biorientation (1) 1
block-cactus graph (1) 1
broadcasting (1) 1
cactus digraph (1) 1
cactus representations (1) 1
closed-form solution (1) 1
code optimization (1) 1
cofactor sums (1) 1
cograph (1) 1
colorings (1) 1
combinatorial optimization (1) 1
communication system control (1) 1
computational mathematics (1) 1
computer networks (1) 1
computer science, hardware & architecture (1) 1
computer science, interdisciplinary applications (1) 1
conflict-free routing (1) 1
connectivity (1) 1
connectivity augmentation (1) 1
construction (1) 1
context (1) 1
control plane (1) 1
convex and discrete geometry (1) 1
cutting plane algorithm (1) 1
deletion (1) 1
diamond hitting set (1) 1
diamonds (1) 1
digraph (1) 1
digraphs (1) 1
directed cactus graph (1) 1
discrete mathematics and combinatorics (1) 1
distance-2 (1) 1
dominators (1) 1
dynamic programming (1) 1
edge-connectivity (1) 1
engineering, electrical & electronic (1) 1
even cycle transversal (1) 1
exact algorithm (1) 1
fixed parameter tractability (1) 1
forests (1) 1
frequenzmultiplex (1) 1
fully polynomial time approximation scheme (1) 1
fully polynomial-time approximation scheme (1) 1
gestaltung (1) 1
girth (1) 1
gossiping (1) 1
graph (1) 1
graphentheorie (1) 1
graphical representations (1) 1
hamiltonian cycle (1) 1
imbalance (1) 1
l -labeling (1) 1
l-labeling (1) 1
labeling graphs (1) 1
labelling (1) 1
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, 02/2018, Volume 236, pp. 288 - 305
.... Dorbec, Schiermeyer, Sidorowicz, and Sopena extended the concept of the rainbow connection to digraphs... 
Cactus digraph | Digraph | Total rainbow connection | Tournament | Biorientation | MATHEMATICS, APPLIED | GRAPHS | Mathematics - Combinatorics
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2017, Volume 37, Issue 2, pp. 301 - 313
An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v... 
cactus | arc colouring | rainbow connectivity | Rainbow connectivity | Cactus | Arc-colouring | MATHEMATICS | arc-colouring
Journal Article
The Electronic journal of linear algebra, ISSN 1537-9582, 05/2020, Volume 36, pp. 277 - 292
Let G = (V, E) be a strongly connected and balanced digraph with vertex set V = {1, ..., n}. The classical distance d... 
Directed cactus graph | MATHEMATICS | Laplacian matrix | Strongly connected balanced digraph | Cofactor sums | Moore-Penrose inverse
Journal Article
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Proceedings of the Conference, 2011, pp. 93 - 96
Conference Proceeding
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 02/2016, Volume 12, Issue 2, pp. 1 - 73
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2013, Volume 161, Issue 12, pp. 1719 - 1725
The L(2,1)-labeling of a digraph D is a function l from the vertex set of D to the set of all nonnegative integers such that |l(x)−l(y... 
Prisms | Oriented graphs | [formula omitted]-labeling | Halin graphs | Cacti | L (h, k) -labeling | COLORINGS | MATHEMATICS, APPLIED | DISTANCE-2 | SQUARE | LABELING GRAPHS | L(h, k)-labeling
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2005, Volume 146, Issue 1, pp. 81 - 91
.... First, we show that the task of determining if there is a directed spanning cactus in a general unweighted digraph is NP-complete... 
Asymmetric TSP | Directed cacti | NP-complete | Spanning cacti | Complexity | complexity | MATHEMATICS, APPLIED | directed cacti | asymmetric TSP | spanning cacti
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2013, Volume 161, Issue 12, pp. 1719 - 1725
The L (2 , 1) -labeling of a digraph D is a function l from the vertex set of D to the set of all nonnegative integers such that | l (x) - l (y... 
Lower bounds | Upper bounds | Mathematical analysis | Cacti | Prisms | Graphs | Mathematical models | Graph theory
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9198, pp. 16 - 29
Conference Proceeding
2005, Volume 146, Issue 1
.... First, we show that the task of determining if there is a directed spanning cactus in a general unweighted digraph is NP-complete... 
complexity | directed cacti | Computational Mathematics | asymmetric TSP | Mathematics | NP-complete | Tillämpad matematik | Naturvetenskap | Applied mathematics | Natural Sciences | Beräkningsmatematik | Matematik | spanning cacti
Publication
Algorithmica, ISSN 0178-4617, 9/2017, Volume 79, Issue 1, pp. 271 - 290
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 9/2004, Volume 8, Issue 3, pp. 295 - 306
Journal Article
No results were found for your search.

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