Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
110
From Skeletons to Bone Graphs: Medial Abstraction for Object Recognition
"... Medial descriptions, such as shock graphs, have gained significant momentum in the shape-based object recognition community due to their invariance to translation, rotation, scale and articulation and their ability to cope with moderate amounts of within-class deformation. While they attempt to deco ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
these advantages by comparing the use of bone graphs to shock graphs in a set of view-based object recognition and pose estimation trials. 1.
Adaptive matching based kernels for labelled graphs
- IN: MINING AND LEARNING WITH GRAPHS (MLG 2006), WITH ECML/PKDD
, 2006
"... Several kernels over labelled graphs have been proposed in the literature so far. Most of them are based on the Cross Product (CP) Kernel applied on decompositions of graphs into sub-graphs of specific types. This approach has two main limitations: (i) it is difficult to choose a-priori the appropr ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
-priori the appropriate type of sub-graphs for a given problem and (ii) all the sub-graphs of a decomposition participate in the computation of the CP kernel even though many of them might be poorly correlated with the class variable. To tackle these problems we pro-pose a class of graph kernels constructed
A Good Characterization of Cograph Contractions
, 1997
"... . A graph is called cograph contraction if it is obtained from a cograph (a graph with no induced path on four vertices) by contracting some pairwise disjoint independent sets and then making the `contracted' vertices pairwise adjacent. This paper gives a good characterization of cograph con ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
contractions, solving a problem posed by M. Hujter and Zs. Tuza. Keywords. Cograph contractions; Cographs; Perfect graphs; 2-SAT 1 Introduction A graph G is called perfect if, for each induced subgraph G 0 of G, the chromatic number of G 0 equals the clique number of G 0 . A classical example
Integrated Intelligent Research (IIR) 671 The Study of Hazards of Plastic Pollution Using Induced Fuzzy Coginitive Maps (IFCMS)
"... Plastic is one of the chemical materials which poses Environmental problem. Plastic is made up of various chemical elements. Therefore, it is regarded as a highly contagious material that does not easily degrade in the natural environment after its usage or utility period. Plastic causes serious dam ..."
Abstract
- Add to MetaCart
damage to environment during its production and disposal process. Poly ethylene, polyvinyl chloride, polystyrene are largely used in the manufacture of Plastics. Hence, this paper analyzes the hazards of Plastic pollution using Induced Fuzzy Cognitive Maps (IFCMs). IFCMs are a fuzzy-graph modeling
On the domination polynomials of non P4-free graphs
- Iran. J. Math. Sci. Informatics
, 2013
"... Abstract. A graph G is called P4-free, if G does not contain an induced subgraph P4. The domination polynomial of a graph G of order n is the polynomial D(G,x) = n i=1 d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i. Every root ofD(G, x) is called a domination root of G. In ..."
Abstract
-
Cited by 5 (5 self)
- Add to MetaCart
Abstract. A graph G is called P4-free, if G does not contain an induced subgraph P4. The domination polynomial of a graph G of order n is the polynomial D(G,x) = n i=1 d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i. Every root ofD(G, x) is called a domination root of G
The computational complexity of disconnected cut and 2k2-partition
- CoRR
, 2011
"... For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent to the follow ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent
Constructing VEGGIE: Machine Learning for
"... Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly effort for their construction and maintenance. Additionally, they are often error prone. These costs limit the research po ..."
Abstract
- Add to MetaCart
potential for studying the growing graph based data in many fields. As interest in applications for natural languages and data mining has increased, the machine learning of graph grammars poses a prime area of research. A unified graph grammar construction, parsing, and inference tool is proposed. Existing
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- European J. Combin
"... Let Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [On 3-Hypergraphs with Forbidden 4-Vertex Configurations, SIAM J. Discr. Math. 24 (2010), 946–963] determined asymptotically the minimum size of a 3-graph on n vertices having neither G0 nor G3 as an induced subgraph. Here we obtai ..."
Abstract
-
Cited by 11 (2 self)
- Add to MetaCart
Let Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [On 3-Hypergraphs with Forbidden 4-Vertex Configurations, SIAM J. Discr. Math. 24 (2010), 946–963] determined asymptotically the minimum size of a 3-graph on n vertices having neither G0 nor G3 as an induced subgraph. Here we
AND
"... The link of a vertex v of a graph G is the subgraph induced by all vertices adja-cent to U. If all the links of G are isomorphic to L, then G has constant link and L is called a link graph. We investigate the trees of order p < 9 to see which are link graphs. Group theoretic methods are used to o ..."
Abstract
- Add to MetaCart
with constant link need not be point symmetric. LINK GRAPHS We consider only finite graphs and follow the terminology of [4]. The link of a vertex u of a graph G, denoted by link@, G), is the subgraph induced by the points adjacent to u, as in [ 11. Zykov [6] posed what has become a well known open problem
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition
- In Proceedings of the 17th annual ACM-SIAM symposium on Discrete Algorithms (SODA
, 2006
"... Max-tolerance graphs can be regarded as generalized interval graphs, where two intervals Ii and Ij only induce an edge in the corresponding graph iff they overlap for an amount of at least max{ti, tj} where ti is an individual tolerance parameter associated to each interval Ii. A new geometric chara ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
Max-tolerance graphs can be regarded as generalized interval graphs, where two intervals Ii and Ij only induce an edge in the corresponding graph iff they overlap for an amount of at least max{ti, tj} where ti is an individual tolerance parameter associated to each interval Ii. A new geometric
Results 11 - 20
of
110
