5889 search results - page 359 / 1178 » Graph Layout Problems |
204
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
242
click to vote
TKDE
2012
13 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
245
click to vote
ICALP
2011
Springer
14 years 10 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 ...
186
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
151
click to vote
IWPEC
2009
Springer
16 years 1 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...