147 search results - page 24 / 30 » Vertex partitions of chordal graphs |
SIAMDM
2008
13 years 9 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SIAMDM
2008
13 years 9 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
BROADNETS
2007
IEEE
14 years 4 months ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...