4865 search results - page 445 / 973 » The Complexity of Graph Connectivity |
186
click to vote
INFOVIS
1999
IEEE
15 years 11 months ago
1999
IEEE
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
212
click to vote
ACISP
1998
Springer
15 years 11 months ago
1998
Springer
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposu...
167
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
158
click to vote
EACL
1993
ACL Anthology
15 years 8 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
171
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...