<--- Back to Details
First PageDocument Content
Graph / Preesm / Graph coloring / Path decomposition / Graph theory / Mathematics / Directed acyclic graph
Date: 2013-02-15 07:08:20
Graph
Preesm
Graph coloring
Path decomposition
Graph theory
Mathematics
Directed acyclic graph

Add to Reading List

Source URL: hal.archives-ouvertes.fr

Download Document from Source Website

File Size: 209,45 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, UniversitĀ“e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

DocID: 1qSPm - View Document

Graph theory / NP-complete problems / Graph operations / Graph coloring / Interval graph / Hamiltonian path / Bipartite graph / Ear decomposition / Indifference graph / Chordal graph / Cograph / Strongly chordal graph

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

DocID: 1qMfK - View Document

Graph theory / Mathematics / Network theory / Edsger W. Dijkstra / Shortest path problem / Graph / Planar separator theorem / Graph coloring

A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

DocID: 1qJe2 - View Document

Graph theory / Mathematics / Network theory / Wireless sensor network / Edsger W. Dijkstra / Flow network / Operations research / Sensor node / Decomposition method / Shortest path problem

Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu Prasun Sinha

DocID: 1qqkW - View Document

Graph theory / Mathematics / Graph coloring / Degree / Graph / Eulerian path / Ear decomposition / NP-complete problems / Graph operations / Dominating set / Incidence coloring

Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

DocID: 1qiDH - View Document