Search results for "edge-sets"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
39	Bryant A. Julstrom	The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.	GECCO	2005	DBLP DOI BibTeX RDF	blob code, edge-sets, routing cost, codings, spanning trees
19	Franz Rothlauf, Carsten Tzschoppe	Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator.	EvoCOP	2005	DBLP DOI BibTeX RDF
15	Wolfgang Steitz, Franz Rothlauf	Orientation matters: how to efficiently solve ocst problems with problem-specific EAs.	GECCO	2008	DBLP DOI BibTeX RDF	optimal communications spanning tree, evolutionary algorithm, heuristics, recombination operators
15	Mandalagiri S. Chandrasekhar, Melvin A. Breuer	Optimal routing of two rectangular blocks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
15	Dorit S. Hochbaum, Asaf Levin	Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.	WAOA	2007	DBLP DOI BibTeX RDF	Approximation algorithms, network design, set cover
12	Alain Hertz, Sacha Varone	The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization.	J. Classif.	2007	DBLP DOI BibTeX RDF
12	Kurt Mehlhorn	Minimum Cycle Bases in Graphs Algorithms and Applications.	MFCS	2007	DBLP DOI BibTeX RDF
10	Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic	Complexity of Maker-Breaker Games on Edge Sets of Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
10	Tim Planken, Torsten Ueckerdt	Shallow Hitting Edge Sets in Uniform Hypergraphs.	CoRR	2023	DBLP DOI BibTeX RDF
10	Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken	Feedback edge sets in temporal graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
10	Daniel Kosmas, John E. Mitchell 0001, Thomas C. Sharkey, Boleslaw K. Szymanski	Optimizing edge sets in networks to produce ground truth communities based on modularity.	Networks	2022	DBLP DOI BibTeX RDF
10	Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi	Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.	STACS	2022	DBLP DOI BibTeX RDF
10	Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi	Tight bounds for counting colorings and connected edge sets parameterized by cutwidth.	CoRR	2021	DBLP BibTeX RDF
10	Daniel Kosmas, John E. Mitchell 0001, Thomas C. Sharkey, Boleslaw K. Szymanski	Optimizing Edge Sets in Networks to Produce Ground Truth Communities Based on Modularity.	CoRR	2021	DBLP BibTeX RDF
10	Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken	Feedback Edge Sets in Temporal Graphs.	CoRR	2020	DBLP BibTeX RDF
10	Xiao Zhao, Fengming Dong, Sheng Chen 0007	On nonfeasible edge sets in matching-covered graphs.	J. Graph Theory	2020	DBLP DOI BibTeX RDF
10	Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken	Feedback Edge Sets in Temporal Graphs.	WG	2020	DBLP DOI BibTeX RDF
10	Kathleen E. Hamilton, Travis S. Humble	Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets.	Quantum Inf. Process.	2017	DBLP DOI BibTeX RDF
10	Tarik Crnovrsanin, Chris Muelder, Robert Faris, Diane Felmlee, Kwan-Liu Ma	Visualization techniques for categorical analysis of social networks with multiple edge sets.	Soc. Networks	2014	DBLP DOI BibTeX RDF
10	Marina Groshaus, Pavol Hell, Juraj Stacho	On edge-sets of bicliques in graphs.	CoRR	2013	DBLP BibTeX RDF
10	S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza	Small Edge Sets Meeting all Triangles of a Graph.	Graphs Comb.	2012	DBLP DOI BibTeX RDF
10	Marina Groshaus, Pavol Hell, Juraj Stacho	On edge-sets of bicliques in graphs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
10	Eli Berger, Henning Bruhn	Eulerian edge sets in locally finite graphs.	Comb.	2011	DBLP DOI BibTeX RDF
10	Stefan Fürtinger, Stephen Keeling, Gernot Plank, Anton J. Prassl	Elastic Registration of Edge Sets by Means of Diffuse Surfaces - With an Application to Embedding Purkinje Fiber Networks.	VISAPP	2011	DBLP BibTeX RDF
10	Günther R. Raidl, Bryant A. Julstrom	Edge sets: an effective evolutionary coding of spanning trees.	IEEE Trans. Evol. Comput.	2003	DBLP DOI BibTeX RDF
10	Robert E. L. Aldred, Michael D. Plummer	On matching extensions with prescribed and proscribed edge sets II.	Discret. Math.	1999	DBLP DOI BibTeX RDF
10	Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer	Two results on matching extensions with prescribed and proscribed edge sets.	Discret. Math.	1999	DBLP DOI BibTeX RDF
10	Nigel Martin	Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs.	Discret. Math.	1994	DBLP DOI BibTeX RDF
10	J. M. S. Simões-Pereira	On matroids on edge sets of graphs with connected subgraphs as circuits II.	Discret. Math.	1975	DBLP DOI BibTeX RDF
10	F. Fleischer, Florian Voss, Volker Schmidt, Catherine Gloaguen	Distributional Properties of Euclidean Distances in Wireless Networks Involving Road Systems.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
10	Jianxin Wang 0001, Guohong Jiang	A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem.	TAMC	2009	DBLP DOI BibTeX RDF
10	Markus Geyer, Michael Kaufmann 0001, Imrich Vrto	Two Trees Which Are Self-intersecting When Drawn Simultaneously.	GD	2005	DBLP DOI BibTeX RDF
10	Daniel Sawitzki	Implicit Flow Maximization by Iterative Squaring.	SOFSEM	2004	DBLP DOI BibTeX RDF
8	Wolfgang Steitz, Franz Rothlauf	Solving OCST problems with problem-specific guided local search.	GECCO	2010	DBLP DOI BibTeX RDF	optimal communications spanning tree, problem-specific adaptation, guided local search
8	Tomoko Izumi, Taisuke Izumi, Hirotaka Ono 0001, Koichi Wada 0001	Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.	COCOON	2009	DBLP DOI BibTeX RDF
8	Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Joseph Mathews, Antony Mathews	Cover-Incomparability Graphs of Posets.	Order	2008	DBLP DOI BibTeX RDF	Underlying graph, Transit function, Claw, Poset, Chordal graph, Distance-hereditary graph
8	Alain Hertz, Sacha Varone	The Metric Cutpoint Partition Problem.	J. Classif.	2008	DBLP DOI BibTeX RDF	Optimal realizations, Cutpoint, Metric spaces, Bridge, Polynomial algorithm
8	Radhika Ramamurthi, Douglas B. West	Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05C65
8	Sang-Moon Soak, David Corne, Byung-Ha Ahn	A New Encoding for the Degree Constrained Minimum Spanning Tree Problem.	KES	2004	DBLP DOI BibTeX RDF
8	Ezio Catanzariti, Raffaele D. Esposito, Roberta Santilli, Matteo Santoro	Toward an automated system for the analysis of cytogenetic abnormalities using fluorescence in situ hybridization technique.	ICIAP	2003	DBLP DOI BibTeX RDF
7	Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu	On a graph packing conjecture by Bollobás, Eldridge and Catlin.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C70
7	Bryant A. Julstrom, Günther R. Raidl	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.	SAC	2002	DBLP DOI BibTeX RDF	random spanning trees, sets of edges, spanning trees, initialization
7	Hong Shen 0001, Keqin Li 0001, Si-Qing Zheng	Separators Are as Simple as Cutsets.	ASIAN	1999	DBLP DOI BibTeX RDF
7	Toshihiro Fujito	A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract).	ESA	1996	DBLP DOI BibTeX RDF
7	Stefan Arnborg, Jens Lagergren, Detlef Seese	Problems Easy for Tree-Decomposable Graphs (Extended Abstract).	ICALP	1988	DBLP DOI BibTeX RDF
5	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions in Graphs and Related Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Cut conjunction, Cut generation, Graph, Matroid, Multicut
5	Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh	Hamiltonicity of hypercubes with a constraint of required and faulty edges.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Hamiltonian cycles and paths, Edge-fault-tolerance, Required edge, Hypercubes
5	Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan	Dependent rounding and its applications to approximation algorithms.	J. ACM	2006	DBLP DOI BibTeX RDF	Randomized rounding, broadcast scheduling
5	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.	ISAAC	2005	DBLP DOI BibTeX RDF
5	Penny E. Haxell, Brendan Nagle, Vojtech Rödl	An Algorithmic Version of the Hypergraph Regularity Method.	FOCS	2005	DBLP DOI BibTeX RDF
5	Leah Bar, Nir A. Sochen, Nahum Kiryati	Image Deblurring in the Presence of Salt-and-Pepper Noise.	Scale-Space	2005	DBLP DOI BibTeX RDF
5	Joan Feigenbaum, Sampath Kannan, Andrew McGregor 0001, Siddharth Suri, Jian Zhang 0004	On Graph Problems in a Semi-streaming Model.	ICALP	2004	DBLP DOI BibTeX RDF
5	Chie Nara, Toshinori Sakai, Jorge Urrutia	Maximal Number of Edges in Geometric Graphs without Convex Polygons.	JCDCG	2002	DBLP DOI BibTeX RDF
5	Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan	Dependent Rounding in Bipartite Graphs.	FOCS	2002	DBLP DOI BibTeX RDF
5	Peter Damaschke	Efficient Dispersion Algorithms for Geometric Intersection Graphs.	WG	2000	DBLP DOI BibTeX RDF