990 search results - page 15 / 198 » Sub-Graphs of Complete Graph |
DM
1999
13 years 7 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
UAI
2004
13 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
DAM
2008
13 years 7 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
RSA
2008
13 years 7 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
DM
2000
13 years 7 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...