1162 search results - page 77 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
134
Voted
FAST
2009
15 years 1 months ago
2009
Versioning file systems provide the ability to recover from a variety of failures, including file corruption, virus and worm infestations, and user mistakes. However, using versio...
156
Voted
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
132
Voted
IJON
2010
15 years 1 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
186
Voted
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...
180
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...