524 search results - page 64 / 105 » On the Maximum Number of Cliques in a Graph |
COMCOM
2008
13 years 7 months ago
2008
Recently, wireless local area network (WLAN) hotspots have been deployed in many areas (e.g., cafes, airports, university campuses). The new IEEE 802.11e standard further provides...
DAM
2002
13 years 7 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ICML
2004
IEEE
14 years 1 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
IPL
2008
13 years 7 months ago
2008
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...