505 search results - page 41 / 101 » On A Graph Formalism for Ordered Edges |
103
Voted
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
83
Voted
SIAMDM
2008
14 years 9 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
PVLDB
2010
14 years 8 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
GD
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
ARSCOM
2007
14 years 9 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...