research
∙
09/06/2020
Strong rainbow disconnection in graphs
Let G be a nontrivial edge-colored connected graph. An edge-cut R of G i...
share
research
∙
08/17/2020
Graph colorings under global structural conditions
More than ten years ago in 2008, a new kind of graph coloring appeared i...
research
∙
01/07/2020
Hardness results for three kinds of colored connections of graphs
The concept of rainbow connection number of a graph was introduced by Ch...
research
∙
01/07/2020
Hardness results for three kinds of connections of graphs
The concept of rainbow connection number of a graph was introduced by Ch...
research
∙
12/21/2019
Complexity results for the proper disconnection of graphs
For an edge-colored graph G, a set F of edges of G is called a proper ed...
research
∙
01/04/2019
Detecting and Diagnosing Energy Issues for Mobile Applications
Energy efficiency is an important criterion to judge the quality of mobi...
research
∙
11/21/2018
Hardness results for rainbow disconnection of graphs
Let G be a nontrivial connected, edge-colored graph. An edge-cut S of G ...
research
∙
05/18/2018
Conflict-free connections: algorithm and complexity
A path in an(a) edge(vertex)-colored graph is called a conflict-free pat...
research
∙
12/25/2017
Conflict-free connection of trees
An edge-colored graph G is conflict-free connected if, between each pair...
research
∙
06/13/2016
ENTRA: Whole-Systems Energy Transparency
Promoting energy efficiency to a first class system design goal is an im...
research
∙
10/14/2015
