36 search results - page 5 / 8 » Finding k Disjoint Triangles in an Arbitrary Graph |
142
click to vote
DAM
2008
15 years 4 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
150
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
191
click to vote
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
128
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
137
click to vote
SIROCCO
2001
15 years 5 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...