Edge-Orders
- 24 September 2018
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 81 (5) , 1881-1900
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (SCHM 3186/1-1)
This publication has 28 references indexed in Scilit:
- A simple test on 2-vertex- and 2-edge-connectivityInformation Processing Letters, 2013
- Certifying algorithmsComputer Science Review, 2011
- Chain Decompositions of 4-Connected GraphsSIAM Journal on Discrete Mathematics, 2005
- A linear-time algorithm for four-partitioning four-connected planar graphsInformation Processing Letters, 1997
- Reducing edge connectivity to vertex connectivityACM SIGACT News, 1991
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphsJournal of Algorithms, 1988
- Dynamic orthogonal segment intersection searchJournal of Algorithms, 1987
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Computing an st-numberingTheoretical Computer Science, 1976
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932