88 search results - page 17 / 18 » On the Complexity of Matroid Isomorphism Problem |
ATAL
2009
Springer
14 years 6 days ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
KI
2005
Springer
13 years 11 months ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
IANDC
2011
13 years 18 days ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
EDBT
2009
ACM
14 years 13 days ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...