223 search results - page 24 / 45 » On Computing Longest Paths in Small Graph Classes |
COMPGEOM
2010
ACM
14 years 15 days ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
BMCBI
2007
13 years 7 months ago
2007
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
WG
1998
Springer
13 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The paper presents a novel protection methodology for setting protected paths in a multiservice GMPLSbased network scenario. By applying the proposed methods, label switched paths...