In this paper, we find that when there are enough parallel edges, any multiple graph is a negative answer to the problem 8.7 in their paper [European J. Combin. 95 (2021), 103329]: Is the restricted-orientable partial-Petrial polynomial of an arbitrary ribbon graph even-interpolating? In...
In general terms there are many reasons in a graph that there could be more than one edge between the same two vertices in the same direction. Most property graph systems allow this and many data models take advantage of this capability. We call these parallel edges. However, in the air-r...
edges filterEdgeEntries.ts getEdgeEntry.ts getGraphEdgesOfType.ts getParallelEdgeEntries.ts index.ts mapFilterEdges.ts mappers.ts realignGraphEdges.ts types.ts nodes recursors tests index.ts toUndirectedKeepEdgeNames.ts types.ts unweightedSteinerSubgraph.ts .eslintrc.cjs .gitatt...
Robbins' theorem states the conditions for a graph to be strongly orientable. His theorem was generalized for mixed graphs, i.e. ones that have both directed and undirected edges. We give a fast parallel algorithm for strongly orienting mixed graphs. We then solve the problem of adding a ...
Our solution exploits efficient data representations as well as algorithmic extensions, both tailored for parallel, in-memory processing. Moreover, when processing RDF data, we reduce the problem size by converting certain nodes and edges into properties. We also propose a new graph query language ...
We refactor GEE into a parallel program in the Ligra graph engine that maps functions over the edges of the graph and uses lock-free atomic instrutions to prevent data races. On a graph with 1.8B edges, this results in a 500 times speedup over the original implementation and a 17 times...
NP-completeness of list coloring and precoloring extension on the edges of planar graphs both problems are NP-complete on (a) planar 3-regular bipartite graphs, (b) bipartite outerplanar graphs, and (c) bipartite series-parallel graphs. Thi... D Marx - 《Journal of Graph Theory》 被引量...
(Nis an integer power of 2) and replacing each vertex of the hypercube by a cycle of logNvertices, each with three ports. ThelogNedges connected to each vertex of the hypercube are now separately connected to logNvertices in the chain, one per vertex. The total number of nodes in cube-...
The input of libgrape-lite is formatted following theLDBC Graph Analyticsbenchmark, with two files for each graph, a.vfile for vertices with 1 or 2 columns, which are a vertex_id and optionally followed by the data assigned to the vertex; and a.efile for edges with 2 or 3 columns, ...
We use it to design an O(m 2 + d) algorithm for edge ranking of graphs obtained by removing O(log m) edges from a complete bipartite graph, where d is a fixed number. Then we extend our results to complete k-partite graphs for any fixed k>2. In this way we give a new ...