5889 search results - page 297 / 1178 » Graph Layout Problems |
159
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
159
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
166
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
149
click to vote
JSAC
2008
15 years 6 months ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...