2612 search results - page 253 / 523 » Switching Graphs and Their Complexity |
209
click to vote
INFOVIS
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
160
click to vote
ESOP
2009
Springer
15 years 9 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
177
click to vote
JMLR
2010
15 years 22 days ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
244
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
163
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...