Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability

Author： Bonizzoni Paola   Dondi Riccardo   Pirola Yuri  

Publisher： MDPI

E-ISSN： 1999-4893|6|1|1-11

ISSN： 1999-4893

Source： Algorithms, Vol.6, Iss.1, 2012-12, pp. : 1-11

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

Duality in Geometric Graphs: Vector Graphs, Kirchhoff Graphs and Maxwell Reciprocal Figures

By Reese Tyler   Paffenroth Randy   Fehribach Joseph D.  

Symmetry, Vol. 8, Iss. 3, 2016-02 ,pp. : 9-9

MDPI

Access to resources Recommend Favorite

Some Invariants of Circulant Graphs

By Munir Mobeen   Nazeer Waqas   Shahzadi Zakia   Kang Shin Min  

Symmetry, Vol. 8, Iss. 11, 2016-11 ,pp. : 134-134

MDPI

Access to resources Recommend Favorite

Hidden Symmetries in Simple Graphs

By Parks Allen D.  

Symmetry, Vol. 4, Iss. 1, 2012-03 ,pp. : 219-224

MDPI

Access to resources Recommend Favorite

Finding Supported Paths in Heterogeneous Networks †

By Fertin Guillaume   Komusiewicz Christian   Mohamed-Babou Hafedh   Rusu Irena  

Algorithms, Vol. 8, Iss. 4, 2015-10 ,pp. : 810-831

MDPI

Access to resources Recommend Favorite