183 search results - page 10 / 37 » On the Matching Problem for Special Graph Classes |
112
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
126
click to vote
ICDE
2011
IEEE
14 years 5 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
109
click to vote
AAAI
2008
15 years 3 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
110
click to vote
JSA
2008
15 years 1 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
115
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...