731 search results - page 26 / 147 » Reductions to Graph Isomorphism |
CIE
2007
Springer
14 years 18 days ago
2007
Springer
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
ICSE
2008
IEEE-ACM
14 years 9 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
EMMCVPR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
DM
2008
13 years 8 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...