1963 search results - page 142 / 393 » The Maximum Solution Problem on Graphs |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
DASFAA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
SMC
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...