620 search results - page 48 / 124 » The edge-flipping group of a graph |
ACSAC
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we present techniques for a network forensics analysis mechanism that includes effective evidence presentation, manipulation and automated reasoning. We propose the...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
ENDM
2008
13 years 9 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
PAKDD
2004
ACM
14 years 2 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...