2612 search results - page 352 / 523 » Switching Graphs and Their Complexity |
133
click to vote
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
151
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
140
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
HECATAEUS is an open-source software tool for enabling impact prediction, what-if analysis, and regulation of relational database schema evolution. We follow a graph theoretic appr...
161
click to vote
AIPS
2010
15 years 5 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
155
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...