Sciweavers

1477 search results - page 110 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CPAIOR
2007
Springer
15 years 10 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 9 months ago
Towards proximity pattern mining in large graphs
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...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
FOCS
2009
IEEE
15 years 11 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans