505 search results - page 47 / 101 » On A Graph Formalism for Ordered Edges |
JGT
2010
14 years 8 months ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
PROCEDIA
2010
14 years 8 months ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
RV
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...