6598 search results - page 269 / 1320 » Graph Theory with Applications |
174
click to vote
PVLDB
2010
15 years 5 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
197
click to vote
TVCG
2012
13 years 9 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
219
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
202
click to vote
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
195
click to vote
LPAR
2005
Springer
16 years 2 days ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...