4865 search results - page 201 / 973 » The Complexity of Graph Connectivity |
125
click to vote
IPL
2006
15 years 3 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
111
Voted
FSTTCS
2007
Springer
15 years 10 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...
124
Voted
AAAI
1993
15 years 5 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
128
Voted
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
130
Voted
ATMOS
2008
15 years 5 months ago
2008
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...