Algorithmica, ISSN 0178-4617, 1/2018, Volume 80, Issue 1, pp. 209 - 233

Motivated by routing in telecommunication network using Software Defined Network (SDN) technologies, we consider the following problem of finding short routing...

Order | Priority | Routing | Theory of Computation | Approximation algorithm | Complexity | Software Defined Networks | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Routing tables | Computer Science | Compact tables | Algorithm Analysis and Problem Complexity | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | SET | Discrete Mathematics

Order | Priority | Routing | Theory of Computation | Approximation algorithm | Complexity | Software Defined Networks | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Routing tables | Computer Science | Compact tables | Algorithm Analysis and Problem Complexity | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | SET | Discrete Mathematics

Journal Article

Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 09/2019, Volume 21 no. 4

Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the...

Computer Science | Discrete Mathematics | Computational Complexity

Computer Science | Discrete Mathematics | Computational Complexity

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 12/2018, Volume 89, Issue 4, pp. 439 - 456

An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle C, there are digraphs containing no subdivision of C (as a...

subdivision | digraph | coloring | MATHEMATICS | LENGTHS | GRAPHS | Mathematics | Combinatorics | Data Structures and Algorithms | Computer Science | Computational Complexity

subdivision | digraph | coloring | MATHEMATICS | LENGTHS | GRAPHS | Mathematics | Combinatorics | Data Structures and Algorithms | Computer Science | Computational Complexity

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 04/2018, Volume 87, Issue 4, pp. 536 - 560

The problem of when a given digraph contains a subdivision of a fixed digraph F is considered. Bang‐Jensen et al. [4] laid out foundations for approaching this...

digraphs | linkages | subdivisions | MATHEMATICS | WIDTH | Hardness | Corporate sponsorship | Mathematics - Combinatorics | Computer Science | Discrete Mathematics

digraphs | linkages | subdivisions | MATHEMATICS | WIDTH | Hardness | Corporate sponsorship | Mathematics - Combinatorics | Computer Science | Discrete Mathematics

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 07/2016, Volume 636, pp. 85 - 94

We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and...

Polynomial | Partition | 2-partition | Minimum degree | Feedback vertex set | Acyclic | Out-branching | Oriented | Splitting digraphs | NP-complete | Semicomplete digraph | Tournament | NUMBER | GRAPHS | CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Integers | Partitions | Classification | Paper | Graph theory | Complexity | Symmetry | Computer Science | Discrete Mathematics

Polynomial | Partition | 2-partition | Minimum degree | Feedback vertex set | Acyclic | Out-branching | Oriented | Splitting digraphs | NP-complete | Semicomplete digraph | Tournament | NUMBER | GRAPHS | CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Integers | Partitions | Classification | Paper | Graph theory | Complexity | Symmetry | Computer Science | Discrete Mathematics

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 08/2016, Volume 640, pp. 1 - 19

We continue the study, initiated in [3], of the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with...

Polynomial | Partition | 2-Partition | Minimum degree | Feedback vertex set | Acyclic | Out-branching | Oriented | Splitting digraphs | NP-complete | Semicomplete digraph | Tournament | GRAPHS | CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Integers | Partitions | Graph theory | Classification | Complexity | Symmetry | Mathematics | Combinatorics | Data Structures and Algorithms | Computer Science | Computational Complexity

Polynomial | Partition | 2-Partition | Minimum degree | Feedback vertex set | Acyclic | Out-branching | Oriented | Splitting digraphs | NP-complete | Semicomplete digraph | Tournament | GRAPHS | CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Integers | Partitions | Graph theory | Classification | Complexity | Symmetry | Mathematics | Combinatorics | Data Structures and Algorithms | Computer Science | Computational Complexity

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2018, Volume 341, Issue 10, pp. 2708 - 2719

A set C⊆V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the...

King grids | Identifying codes | Discharging method | MATHEMATICS | BOUNDS | VERTICES | SENSOR NETWORKS | Computer Science | Discrete Mathematics

King grids | Identifying codes | Discharging method | MATHEMATICS | BOUNDS | VERTICES | SENSOR NETWORKS | Computer Science | Discrete Mathematics

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 11/2018, Volume 89, Issue 3, pp. 304 - 326

A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic number of a graph is large enough, either the graph contains a...

chromatic number | χ‐bounded | clique number | χ-bounded | Computer Science | Discrete Mathematics

chromatic number | χ‐bounded | clique number | χ-bounded | Computer Science | Discrete Mathematics

Journal Article

Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 06/2016, Volume 52, pp. 351 - 358

A communication in a network is a pair of nodes (s,t). The node s is called the source source and t the destination. A routing of a communication (s,t) is a...

routing | compact routing tables | complexity | approximation algorithms | software defined networks | Approximation algorithms | Routing | Compact routing tables | Software defined networks | Complexity

routing | compact routing tables | complexity | approximation algorithms | software defined networks | Approximation algorithms | Routing | Compact routing tables | Software defined networks | Complexity

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 04/2018, Volume 87, Issue 4, pp. 536 - 560

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2018, Volume 245, pp. 155 - 167

A function f:V(G)→{1,…,k} is a (proper) k-colouring of G if ∣f(u)−f(v)∣≥1, for every edge uv∈E(G). The chromatic numberχ(G) is the smallest integer k for which...

Graph colouring | Steinberg’s conjecture | Planar graph | Backbone colouring | Steinberg's conjecture | MATHEMATICS, APPLIED | PLANAR GRAPHS | TREE | Computer Science | Discrete Mathematics

Graph colouring | Steinberg’s conjecture | Planar graph | Backbone colouring | Steinberg's conjecture | MATHEMATICS, APPLIED | PLANAR GRAPHS | TREE | Computer Science | Discrete Mathematics

Journal Article

Journal of Discrete Algorithms, ISSN 1570-8667, 10/2012, Volume 16, pp. 53 - 66

In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. In wireless networks, a...

Graph colouring | Radio networks | Frequency assignment | Improper colouring | Interference | Data Structures and Algorithms | Computer Science | Discrete Mathematics

Graph colouring | Radio networks | Frequency assignment | Improper colouring | Interference | Data Structures and Algorithms | Computer Science | Discrete Mathematics

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 11, pp. 3553 - 3563

We show that the choice number of the square of a subcubic graph with maximum average degree less than 18 / 7 is at most 6. As a corollary, we get that the...

List colouring | Bounded density | Planar graph | Square of a graph | MATHEMATICS | Computer Science | Discrete Mathematics

List colouring | Bounded density | Planar graph | Square of a graph | MATHEMATICS | Computer Science | Discrete Mathematics

Journal Article

Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2009, Volume 35, Issue C, pp. 275 - 280

A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one ( u , v ) -path with...

channel assignment | matching-cut | planar graphs | edge-labelling

channel assignment | matching-cut | planar graphs | edge-labelling

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 08/2016, Volume 639, pp. 14 - 25

An orientation of a graph G is proper if two adjacent vertices have different in-degrees. The proper-orientation numberχ→(G) of a graph G is the minimum...

Proper orientation | Cactus graph | Graph coloring | Block graph | Planar graph | Claw-free graph | NUMBER | COMPUTER SCIENCE, THEORY & METHODS | Graphs | Graph theory | Orientation | Cacti | Computer Science | Discrete Mathematics

Proper orientation | Cactus graph | Graph coloring | Block graph | Planar graph | Claw-free graph | NUMBER | COMPUTER SCIENCE, THEORY & METHODS | Graphs | Graph theory | Orientation | Cacti | Computer Science | Discrete Mathematics

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 11/2019

Journal Article

Discrete Mathematics, ISSN 0012-365X, 07/2017, Volume 340, Issue 7, pp. 1584 - 1597

A set C⊂V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the...

Triangular grids | Identifying codes | MATHEMATICS | VERTICES | BOUNDS | Computer Science | Discrete Mathematics

Triangular grids | Identifying codes | MATHEMATICS | VERTICES | BOUNDS | Computer Science | Discrete Mathematics

Journal Article

Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2017, Volume 62, pp. 51 - 56

A set C⊆V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the...

Discharging Method | King grid | Identifying code | Computer Science | Discrete Mathematics

Discharging Method | King grid | Identifying code | Computer Science | Discrete Mathematics

Journal Article

Discrete Mathematics, ISSN 0012-365X, 02/2008, Volume 308, Issue 4, pp. 496 - 513

Journal Article

Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2017, Volume 62, pp. 69 - 74

A (k1+k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al....

Digraph | subdivision | chromatic number | Computer Science | Discrete Mathematics

Digraph | subdivision | chromatic number | Computer Science | Discrete Mathematics

Journal Article

No results were found for your search.

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