1857 search results - page 32 / 372 » Minimum Degree Orderings |
166
click to vote
DM
2008
15 years 6 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...
157
click to vote
ICPR
2008
IEEE
16 years 20 days ago
2008
IEEE
Overlapping classes and outliers can significantly decrease a classifier performance. We adress here the problem of giving a classifier the ability to reject some patterns eith...
165
click to vote
IJMSO
2008
15 years 6 months ago
2008
: Ontology mapping has a key importance for applications such as information retrieval, database integration, and agent-communication. This paper presents an Argumentation Framewor...
164
click to vote
GC
2010
Springer
15 years 3 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
112
click to vote
ACCV
2009
Springer
16 years 26 days ago
2009
Springer
Fundamental matrix, drawing geometric relationship between two images, plays an important role in 3-dimensional computer vision. Degenerate configurations of space points and two ...