4865 search results - page 382 / 973 » The Complexity of Graph Connectivity |
150
click to vote
GPEM
2008
15 years 6 months ago
2008
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
219
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
219
click to vote
SIGMOD
2010
ACM
15 years 5 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...
215
Voted
BMCBI
2011
15 years 1 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...
152
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...