796 search results - page 71 / 160 » The Anonymous Subgraph Problem |
92
Voted
ALGORITHMICA
2008
15 years 27 days ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
129
click to vote
ESORICS
2009
Springer
15 years 7 months ago
2009
Springer
The increasing availability of space-time trajectories left by location-aware devices is expected to enable novel classes of applications where the discovery of consumable, concise...
99
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
137
click to vote
WWW
2011
ACM
14 years 7 months ago
2011
ACM
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
DAC
1996
ACM
15 years 4 months ago
1996
ACM
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...