colored edge
Recently Published Documents


TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2018 ◽  
Author(s):  
Luerbio Faria ◽  
Sulamita Klein ◽  
Ignasi Sau ◽  
Uéverton S. Souza ◽  
Rubens Sucupira

In this work we present some results on the classical and parameterized complexity of finding cuts in edge-colored graphs. In general, we are interested in problems of finding cuts {A,B} which minimize or maximize the number of colors occurring in the edges with exactly one endpoint in A.  


2016 ◽  
Vol 33 (01) ◽  
pp. 1650005 ◽  
Author(s):  
Andrew Ensor ◽  
Felipe Lillo

Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena and telecommunication networks. Existing techniques for determining minimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing the multimodal traits of the network during analysis. In this paper weighted colored-edge graphs are introduced for modeling multimodal networks, where colors represent the modes of transportation. Minimal paths are selected using a partial order that compares the weights in each color, resulting in a Pareto set of minimal paths. Although the computation of minimal paths is theoretically intractable and [Formula: see text]-complete, the approach is shown to be tractable through experimental analyses without the need to apply heuristics or constraints.


Sign in / Sign up

Export Citation Format

Share Document