3471 search results - page 139 / 695 » Obstacle Numbers of Graphs |
EPIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
STOC
1990
ACM
14 years 1 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
FORTE
1998
13 years 11 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
DM
2006
13 years 9 months ago
2006
In 1985, Erdos and Ne