7129 search results - page 1346 / 1426 » Approximation Algorithms for Treewidth |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
UC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states....
IMC
2009
ACM
15 years 4 months ago
2009
ACM
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
118
click to vote
ASIAMS
2007
IEEE
15 years 4 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...