1162 search results - page 128 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
NETWORK
2010
13 years 2 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
CSMR
2009
IEEE
14 years 2 months ago
2009
IEEE
It is important to focus on security aspects during the development cycle to deliver reliable software. However, locating security faults in complex systems is difficult and ther...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...