7 search results - page 1 / 2 » Large Nearly Regular Induced Subgraphs |
SIAMDM
2008
13 years 4 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
TCS
2008
13 years 4 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
JGAA
2007
13 years 4 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
TIP
2010
12 years 11 months ago
2010
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Link prediction is an important task in social networks and data mining for understanding the mechanisms by which the social networks form and evolve. In most link prediction rese...