1986 search results - page 265 / 398 » Path Separability of Graphs |
103
Voted
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
137
Voted
JMLR
2012
13 years 5 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
165
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
163
Voted
SODA
2010
ACM
16 years 8 hour ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
138
Voted
GD
2005
Springer
15 years 8 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...