Mathematical Models and a Constructive Heuristic for Finding Minimum Fundamental Cycle Bases
Leo Liberti, Edoardo Amaldi, Francesco Maffioli, Nelson Maculan (2005)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Generating a random sink-free orientation in quadratic time.”
Mathematical Models and a Constructive Heuristic for Finding Minimum Fundamental Cycle Bases
Two-layer planarization: improving on parameterized algorithmics.
Fernau, Henning (2005)
Journal of Graph Algorithms and Applications
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The traveling salesman problem for cubic graphs.
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity:
Traversing directed Eulerian mazes.
Bhatt, S., Even, S., Greenberg, D., Tayar, R. (2002)
Journal of Graph Algorithms and Applications
Similarity:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On-line Ramsey theory for bounded degree graphs.
Butterfield, Jane, Grauman, Tracy, Kinnersley, William B., Milans, Kevin G., Stocker, Christopher, West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Few colored cuts or cycles in edge colored graphs
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity: