9532 search results - page 418 / 1907 » Logic, Graphs, and Algorithms |
145
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
174
click to vote
JMLR
2006
15 years 6 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
220
Voted
IEICET
2011
15 years 1 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
208
click to vote
AAAI
2012
13 years 9 months ago
2012
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
177
click to vote
ACIVS
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...