1952 search results - page 238 / 391 » Complete partitions of graphs |
180
click to vote
ATMOS
2007
15 years 8 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
177
click to vote
SIROCCO
2007
15 years 8 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
196
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have...
195
click to vote
CN
2010
15 years 3 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
183
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...