2612 search results - page 169 / 523 » Switching Graphs and Their Complexity |
133
click to vote
SIGMOD
2010
ACM
14 years 11 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
137
Voted
BMCBI
2011
14 years 8 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
109
click to vote
FCS
2006
15 years 2 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
123
click to vote
DEDS
2002
15 years 27 days ago
2002
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
89
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...