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

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

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

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

... of the article discusses applications to edge-and vertex connectivity, both combinatorial and algorithmic, that we now describe. For digraphs, a natural interpretation...

dominators | Posets | cactus representation | connectivity augmentation | code optimization | Dominators | Code optimization | Connectivity augmentation | Cactus representation | MATHEMATICS, APPLIED | NETWORK | FAST ALGORITHM | CACTUS REPRESENTATIONS | EDGE-CONNECTIVITY | RIGIDITY | COMPUTER SCIENCE, THEORY & METHODS | MINIMUM CUTS | Networks | Construction | Algorithms | Labelling | Set theory | Graphs | Graph theory | Graphical representations

dominators | Posets | cactus representation | connectivity augmentation | code optimization | Dominators | Code optimization | Connectivity augmentation | Cactus representation | MATHEMATICS, APPLIED | NETWORK | FAST ALGORITHM | CACTUS REPRESENTATIONS | EDGE-CONNECTIVITY | RIGIDITY | COMPUTER SCIENCE, THEORY & METHODS | MINIMUM CUTS | Networks | Construction | Algorithms | Labelling | Set theory | Graphs | Graph theory | Graphical representations

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

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

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

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

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, 2/2013, Volume 65, Issue 2, pp. 317 - 338

Given an undirected and edge-weighted graph G together with a set of ordered vertex-pairs, called st-pairs, we consider two problems of finding an orientation...

Graph orientation | Fully polynomial-time approximation scheme | Planar graph | Theory of Computation | Approximation algorithm | Reachability | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Cactus | Dynamic programming | Algorithm Analysis and Problem Complexity | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ORIENTING GRAPHS | Universities and colleges

Graph orientation | Fully polynomial-time approximation scheme | Planar graph | Theory of Computation | Approximation algorithm | Reachability | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Cactus | Dynamic programming | Algorithm Analysis and Problem Complexity | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ORIENTING GRAPHS | Universities and colleges

Journal Article

Algorithmica, ISSN 0178-4617, 9/2017, Volume 79, Issue 1, pp. 271 - 290

Let $${\mathcal {F}}$$ F be a family of graphs. Given an n-vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Diamond Hitting Set | Randomized algorithms | Theory of Computation | Algorithm Analysis and Problem Complexity | Even Cycle Transversal | Fixed parameter tractability | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ALGORITHMS

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Diamond Hitting Set | Randomized algorithms | Theory of Computation | Algorithm Analysis and Problem Complexity | Even Cycle Transversal | Fixed parameter tractability | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ALGORITHMS

Journal Article

13.
Full Text
On Conflict-Free All-to-All Broadcast in One-Hop Optical Networks of Arbitrary Topologies

IEEE/ACM Transactions on Networking, ISSN 1063-6692, 10/2009, Volume 17, Issue 5, pp. 1619 - 1630

In this paper, we investigate the problem of all-to-all broadcast in optical networks, also known as gossiping. This problem is very important in the context...

Context | gossiping | Wavelength assignment | Communication system control | Optical wavelength conversion | Optical fiber networks | Wavelength division multiplexing | Closed-form solution | control plane | Wavelength routing | cactus representation | Arbitrary topology | Network topology | conflict-free routing | optical network | Broadcasting | Gossiping | Conflict-free routing | Optical network | Control plane | Cactus representation | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | FAST ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | Studies | Algorithms | Wavelengths | Optical communication | Graphs | Computer networks | Topology

Context | gossiping | Wavelength assignment | Communication system control | Optical wavelength conversion | Optical fiber networks | Wavelength division multiplexing | Closed-form solution | control plane | Wavelength routing | cactus representation | Arbitrary topology | Network topology | conflict-free routing | optical network | Broadcasting | Gossiping | Conflict-free routing | Optical network | Control plane | Cactus representation | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | FAST ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | Studies | Algorithms | Wavelengths | Optical communication | Graphs | Computer networks | Topology

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 9/2004, Volume 8, Issue 3, pp. 295 - 306

This paper studies the following variations of arboricity of graphs. The vertex (respectively, tree) arboricity of a graph G is the minimum number va(G)...

hamiltonian cycle | tree | Mathematics | Theory of Computation | series-parallel graph | planar graph | Optimization | cograph | arboricity | Convex and Discrete Geometry | block-cactus graph | girth | acyclic | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Arboricity | Hamiltonian cycle | Acyclic | Planar graph | Series-parallel graph | Tree | Block-cactus graph | Girth | Cograph | MATHEMATICS, APPLIED | ACYCLIC COLORINGS | THEOREM | POINT-ARBORICITY | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | PLANAR GRAPHS | Algorithms

hamiltonian cycle | tree | Mathematics | Theory of Computation | series-parallel graph | planar graph | Optimization | cograph | arboricity | Convex and Discrete Geometry | block-cactus graph | girth | acyclic | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Arboricity | Hamiltonian cycle | Acyclic | Planar graph | Series-parallel graph | Tree | Block-cactus graph | Girth | Cograph | MATHEMATICS, APPLIED | ACYCLIC COLORINGS | THEOREM | POINT-ARBORICITY | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | PLANAR GRAPHS | Algorithms

Journal Article

No results were found for your search.

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