Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,958,126 papers from all fields of science
Search
Sign In
Create Free Account
Multiple edges
Known as:
Multi-edge
, Multiple edge
, Parallel edges
In graph theory, multiple edges (also called parallel edges or a multi-edge), are two or more edges that are incident to the same two vertices. A…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Dipole graph
Dowling geometry
Flip graph
Graph (discrete mathematics)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Time Traveling in Graphs using a Graph Database
Konstantinos Semertzidis
,
E. Pitoura
EDBT/ICDT Workshops
2016
Corpus ID: 7010045
Most graph structured data, such as data created from the web, social, citation and computer networks, evolve over time. In this…
Expand
2013
2013
Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient Modulation
Lei M. Zhang
,
F. Kschischang
IEEE Transactions on Communications
2013
Corpus ID: 31386675
A method of designing low-density parity-check codes for bandwidth-efficient high-order modulation is proposed. A multi-edge-type…
Expand
2013
2013
Contractions, Removals, and Certifying 3-Connectivity in Linear Time
Jens M. Schmidt
SIAM journal on computing (Print)
2013
Corpus ID: 12576882
One of the most noted construction methods of $3$-vertex-connected graphs is due to Tutte and is based on the following fact: Any…
Expand
2010
2010
A Linguistically Grounded Graph Model for Bilingual Lexicon Extraction
Florian Laws
,
Lukas Michelbacher
,
B. Dorow
,
Christian Scheible
,
U. Heid
,
Hinrich Schütze
International Conference on Computational…
2010
Corpus ID: 15115888
We present a new method, based on graph theory, for bilingual lexicon extraction without relying on resources with limited…
Expand
Highly Cited
2008
Highly Cited
2008
Caging Polygons with Two and Three Fingers
Mostafa Vahedi
,
A.F. van der Stappen
Int. J. Robotics Res.
2008
Corpus ID: 1526999
We study two- and three-finger caging grasps of a given polygonal object with n edges. A grasp is said to cage an object when it…
Expand
2006
2006
On-board camera extrinsic parameter estimation
A. Sappa
,
David Gerónimo
,
F. Dornaika
,
Antonio M. López
2006
Corpus ID: 14185686
An efficient technique for real-time estimation of camera extrinsic parameters is presented. It is intended to be used on on…
Expand
1999
1999
Immobilizing a Shape
J. Czyzowicz
,
I. Stojmenovic
,
J. Urrutia
International journal of computational geometry…
1999
Corpus ID: 15713824
Let shape P be any simply-connected set in the plane, bounded by a Jordan curve, that is not a circular disk. We say that a set…
Expand
1997
1997
Flows in undirected unit capacity networks
A. Goldberg
,
Satish Rao
Proceedings 38th Annual Symposium on Foundations…
1997
Corpus ID: 1664868
We describe an O(min(m, n/sup 3/2/)m/sup 1/2/)-time algorithm for finding maximum flows in undirected networks with unit…
Expand
1997
1997
Complete bipartite factorisations by complete bipartite graphs
N. Martin
Discrete Mathematics
1997
Corpus ID: 20038701
1984
1984
On a problem of a. kotzig concerning factorizations of 4-regular graphs
B. Zelinka
Journal of Graph Theory
1984
Corpus ID: 32838418
The paper gives a solution of a problem of A. Kotzǐg. This problem concerns the 4-regular graphs G with the property that in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE