2125 search results - page 208 / 425 » On Graph Complexity |
159
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
136
click to vote
ASUNAM
2010
IEEE
15 years 4 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
272
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
124
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
103
click to vote
ECOOP
2006
Springer
15 years 6 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...