Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
edge ordering
Description:
Edge ordering is an arrangement of a graph’s edges in a sequence, used in graph algorithms, partitioning, and network analysis.
Primary topic:
Advanced Graph Theory Research (23%)
Related topics:
Advanced Graph Theory Research (23%),
Limits and Structures in Graph Theory (13%),
Complexity and Algorithms in Graphs (10%)
OpenAlex ID:
keywords/edge-ordering
Premise Selection for Theorem Proving by Deep Graph Embedding
2017
·
Wang, Mingzhe
, Tang, Yihe
, et al.
·
arXiv (Cornell University)
·
150
PDF
Untangling Cycles for Contour Grouping
2007
·
Qihui Zhu
, Gang Song
, et al.
·
IEEE/CVF International Conference on Computer Vision (ICCV)
·
115
PDF
Printing arbitrary meshes with a 5DOF wireframe printer
2016
·
Rundong Wu
, Huaishu Peng
, et al.
·
ACM Transactions on Graphics
·
100
PDF
Edge-based image restoration
2005
·
A. Rares
, M.J.T. Reinders
, et al.
·
IEEE Transactions on Image Processing
·
86
Algorithms and obstructions for linear-width and related search parameters
2000
·
Dimitrios M. Thilikos
·
Discrete Applied Mathematics
·
77
Assigning times to minimise reachability in temporal graphs
2020
·
Jessica Enright
, Kitty Meeks
, et al.
·
Journal of Computer and System Sciences
·
54
PDF
A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism
2018
·
Patrick Mackey
, Katherine Porterfield
, et al.
·
IEEE International Conference on Big Data (BigData)
·
53
PDF
Distributed Algorithms for Planar Networks I
2016
·
Mohsen Ghaffari
, Bernhard Haeupler
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
52
Increasing paths in edge ordered graphs
1973
·
R. L. Graham
, D. J. Kleitman
·
Periodica Mathematica Hungarica
·
47
The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs
2017
·
Graham Cormode
, Hossein Jowhari
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
42
PDF
A class of solutions to the gossip problem, part I
1982
·
Douglas B. West
·
Discrete Mathematics
·
35
Curriculum Learning for Graph Neural Networks: Which Edges Should We Learn First
2023
·
Zheng Zhang
, Junxiang Wang
, et al.
·
neural information processing systems
·
32
PDF
Choosing a heuristic and root node for edge ordering in BDD-based network reliability analysis
2014
·
Yuchang Mo
, Liudong Xing
, et al.
·
Reliability Engineering & System Safety
·
31
Local approximation schemes for topology control
2006
·
Mirela Damian
, Saurav Pandit
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
31
PDF
A collection of sets related to the tutte polynomial of a matroid
1984
·
Jeremy E Dawson
·
Lecture notes in mathematics
·
30
Weak saturation numbers of complete bipartite graphs in the clique
2020
·
Gal Kronenberg
, Taísa Martins
, et al.
·
Journal of Combinatorial Theory Series A
·
29
Increasing Hamiltonian paths in random edge orderings
2015
·
Mikhail Lavrov
, Po‐Shen Loh
·
Random Structures and Algorithms
·
29
PDF
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy
2024
·
Kaixin Wang
, Kaiqiang Yu
, et al.
·
Proceedings of the ACM on Management of Data
·
28
PDF
Monotone paths in edge-ordered sparse graphs
2001
·
Yehuda Roditty
, Barack Shoham
, et al.
·
Discrete Mathematics
·
26
PDF
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
2013
·
Thomas Bläsius
, Annette Karrer
, et al.
·
Algorithmica
·
25
PDF
An Approach to Parallelize Kruskal's Algorithm Using Helper Threads
2012
·
Anastasios Katsigiannis
, Nikos Anastopoulos
, et al.
·
IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
·
23
Nearly-linear monotone paths in edge-ordered graphs
2020
·
Matija Bucić
, Matthew Kwan
, et al.
·
Israel Journal of Mathematics
·
22
PDF
Weak saturation numbers for sparse graphs
2013
·
Ralph J. Faudree
, Ronald J. Gould
, et al.
·
Discussiones Mathematicae Graph Theory
·
22
PDF
Fourientations and the Tutte polynomial
2017
·
Spencer Backman
, Sam Hopkins
·
Research in the Mathematical Sciences
·
21
PDF
Planar embedding: linear-time algorithms for vertex placement and edge orderings
1988
·
R. Jayakumar
, K. Thulasiraman
, et al.
·
IEEE Transactions on Circuits and Systems
·
21
Show more works
View as search
Works count:
160
Citation count:
1,696
Year
Topic
Type