The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase 3-edge-coloring (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1971-1984 (16) 1986-1991 (15) 1992-1994 (19) 1995-1996 (18) 1997-1999 (17) 2000-2001 (21) 2002-2003 (27) 2004-2005 (32) 2006 (17) 2007 (18) 2008 (19) 2009 (20) 2010 (17) 2011 (16) 2012 (20) 2013 (19) 2014 (20) 2015 (19) 2016 (23) 2017 (27) 2018 (26) 2019 (27) 2020 (27) 2021 (16) 2022 (24) 2023 (29) 2024 (14)
Publication types (Num. hits)
article(414) book(1) incollection(2) inproceedings(142) phdthesis(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 143 occurrences of 100 keywords

Results
Found 563 publication records. Showing 563 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
88Uriel Feige, Mohit Singh Edge Coloring and Decompositions of Weighted Graphs. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
87Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang 0004, Jan-Jan Wu Generalized Edge Coloring for Channel Assignment in Wireless Networks. Search on Bibsonomy ICPP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
70Chang-Wu Yu 0001 On the Complexity of the Max-Edge-Coloring Problem with Its Variants. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multi-graphs, bipartite graphs, algorithm design, edge coloring
70Xiao Zhou 0001, Takao Nishizeki Algorithm for the Cost Edge-Coloring of Trees. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF cost edge-coloring, tree, matching, bipartite graph
69Mathieu Bouchard, Alain Hertz, Guy Desaulniers Lower bounds and a tabu search algorithm for the minimum deficiency problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimum deficiency problem, Tabu search, Edge coloring
66José R. Correa, Michel X. Goemans An approximate König's theorem for edge-coloring weighted bipartite graphs. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF bipartite edge coloring, rearrangeability of 3-stage clos networks, bin packing
66Shin-Ichi Nakano, Xiao Zhou 0001, Takao Nishizeki Edge-Coloring Algorithms. Search on Bibsonomy Computer Science Today The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
63Guizhen Liu, Changqing Xu Some Topics on Edge-Coloring. Search on Bibsonomy CJCDGCGT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
62Iyad A. Kanj, Andreas Wiese, Fenghui Zhang Local Algorithms for Edge Colorings in UDGs. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
60Richard Cole 0001, Lukasz Kowalik New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Algorithm, Planar graph, Edge-coloring, Linear-time
59Peter Sanders 0001, David Steurer An asymptotic approximation scheme for multigraph edge coloring. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF chromatic index, data migration, Edge coloring, multigraphs
59Daniel Kobler, Udi Rotics Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set
56Huimin Song, Jianliang Wu, Guizhen Liu The Equitable Edge-Coloring of Series-Parallel Graphs. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF equitable, edge-coloring, series-parallel graph
56Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr. An experimental study of a simple, distributed edge-coloring algorithm. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF experimental analysis of algorithms, scheduling, Distributed algorithms, high performance computing, randomized algorithms, edge coloring
55Gruia Calinescu, Michael J. Pelsmajer Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. Search on Bibsonomy FSTTCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
54Takehiro Ito, Marcin Kaminski 0001, Erik D. Demaine Reconfiguration of List Edge-Colorings in a Graph. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
53Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai Comparing First-Fit and Next-Fit for Online Edge Coloring. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
52Xiao Zhou 0001, Takao Nishizeki Edge-Coloring and f-Coloring for Various Classes of Graphs. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
49David Eppstein Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
49Noga Alon, Vera Asodi Edge Coloring with Delays. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
49Xiao Zhou 0001, Takao Nishizeki Algorithm for the Cost Edge-Coloring of Trees. Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
49Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. Search on Bibsonomy INFOCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Takehiro Ito, Akira Kato, Xiao Zhou 0001, Takao Nishizeki Algorithms for Finding Distance-Edge-Colorings of Graphs. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
46Gianluca De Marco, Andrzej Pelc Fast distributed graph coloring with O(Delta) colors. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
46Jon Lee 0001, Janny Leung, Sven de Vries Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF odd cycle, integer program, separation, edge coloring, binary encoding
45Noga Alon, Ayal Zaks Algorithmic Aspects of Acyclic Edge Colorings. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Acyclic edge coloring, Girth
45Wolfgang Slany The Complexity of Graph Ramsey Games. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF combinatorial games, graph Ramsey theory, Ramsey game, winning strategy, achievement game, avoidance game, the game of Sim, endgames, complexity, Java applet, edge coloring, PSPACE-completeness
45Arthur L. Liestman, Dana S. Richards Network Communication in Edge-Colored Graphs: Gossiping. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF scheduling communications, scheduling, multiprocessor interconnection networks, gossiping, network communication, graph colouring, edge-colored graphs
42Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
42Xiao Zhou 0001, K. Fuse, Takao Nishizeki A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
42Gagan Aggarwal, Rajeev Motwani 0001, Devavrat Shah, An Zhu Switch Scheduling via Randomized Edge Coloring. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
41Dániel Marx The complexity of chromatic strength and chromatic edge strength. Search on Bibsonomy Comput. Complex. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 68Q17, Subject classification
41Shashidhar Gandham, Milind Dawande, Ravi Prakash 0001 Link scheduling in sensor networks: distributed edge coloring revisited. Search on Bibsonomy INFOCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Leiming Xu, Yong Xiang, Meilin Shi A novel channel assignment algorithm based on topology simplification in multi-radio wirelesss mesh networks. Search on Bibsonomy IPCCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Wangsen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang Approximation Algorithms for Maximum Edge Coloring Problem. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano Approximate Constrained Bipartite Edge Coloring. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39André C. Pinho, Alexandre A. Santos, Daniel R. Figueiredo 0001, Felipe M. G. França Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs. Search on Bibsonomy Networking The full citation details ... 2009 DBLP  DOI  BibTeX  RDF distance-2, WSN, algorithms, MAC
39Peter Sanders 0001, David Steurer An asymptotic approximation scheme for multigraph edge coloring. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
39Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi Parallel Edge Coloring of a Tree on a Mesh Connected Computer. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Shing-Tsaan Huang, Chi-Hung Tzeng Distributed edge coloration for bipartite networks. Search on Bibsonomy Distributed Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Fault-tolerance, Distributed system, Self-stabilization, Edge coloring
38Xia Zhang, Guizhen Liu A Class of Graphs of f -Class 1. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF simple graph, f-coloring, f-chromatic index, Edge-coloring
35Xuechao Li, Rong Luo Edge Coloring of Embedded Graphs with Large Girth. Search on Bibsonomy Graphs Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Edge chromatic number, Euler contribution, Edge coloring
35Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick New Bounds for the Nearly Equitable Edge Coloring Problem. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Christopher L. Barrett, V. S. Anil Kumar 0001, Madhav V. Marathe, Shripad Thite, Gabriel Istrate Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. Search on Bibsonomy PerCom Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Martin Kochol, Nad'a Krivonáková, Silvia Smejová Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Hiroshi Tamura, Kaoru Watanabe, Masakazu Sengoku, Shoji Shinoda On a new edge coloring related to multihop wireless networks. Search on Bibsonomy APCCAS (2) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr. An experimental study of a simple, distributed edge coloring algorithm. Search on Bibsonomy SPAA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Xiao Zhou 0001, Shin-Ichi Nakano, Takao Nishizeki A Parallel Algorithm for Edge-Coloring Partial k-Trees. Search on Bibsonomy SWAT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
35Xiao Zhou 0001, Takao Nishizeki Algorithms for Finding f-Colorings of Partial k-Trees. Search on Bibsonomy ISAAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
32Akiyoshi Shioura, Mutsunori Yagiura A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Hung Q. Ngo 0001, Van H. Vu Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
32Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano Edge Coloring of Bipartite Graphs with Constraints. Search on Bibsonomy MFCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
29Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita 0001, Narayanan Narayanan, Reza Naserasr, Petru Valicov From Edge-Coloring to Strong Edge-Coloring. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Weifa Liang, Xiaojun Shen 0002, Qing Hu 0007 Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko Min Sum Edge Coloring in Multigraphs Via Configuration LP. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Edge Scheduling, Configuration LP, Approximation Algorithms
28Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos On the Maximum Edge Coloring Problem. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28András Gyárfás Transitive Edge Coloring of Graphs and Dimension of Lattices. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) 05C15
28Richard Cole 0001, Kirstin Ost, Stefan Schirra Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 68W05, 68W40
28Xiao Zhou 0001, Shin-Ichi Nakano, Takao Nishizeki A Linear Algorithm for Edge-Coloring Partial k-Trees. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
28Harold N. Gabow, San Skulrattanakulchai Coloring Algorithms on Subcubic Graphs. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza Ranking of Graphs. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
25Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos Approximating the Max Edge-Coloring Problem. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
25Chadi Kari, Yoo Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin Soft Edge Coloring. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Lukasz Kowalik Improved Edge-Coloring with Three Colors. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Lene M. Favrholdt, Morten N. Nielsen On-Line Edge-Coloring with a Fixed Number of Colors. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
25Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski Distributed O(Delta log(n))-Edge-Coloring Algorithm. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
25Lene M. Favrholdt, Morten N. Nielsen On-Line Edge-Coloring with a Fixed Number of Colors. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
25Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
25Johannes Schneider 0002, Roger Wattenhofer A new technique for distributed symmetry breaking. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF parallel algorithms, coloring, local algorithms, symmetry breaking, network decomposition
24Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein New Results on Edge-coloring and Total-coloring of Split Graphs. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Leonid Barenboim, Michael Elkin, Tzalik Maimon Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. Search on Bibsonomy PODC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
24Leonid Barenboim, Michael Elkin, Tzalik Maimon Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
24Csilla Bujtás, E. Sampathkumar 0001, Zsolt Tuza, Charles Dominic, L. Pushpalatha When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Search on Bibsonomy Ars Comb. The full citation details ... 2016 DBLP  BibTeX  RDF
24Henning Bruhn, Richard Lang, Maya Stein List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. Search on Bibsonomy J. Graph Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
24Shuang-Liang Tian, Ping Chen Distance Coloring and Distance Edge-Coloring of d- dimensional Lattice. Search on Bibsonomy ICIC (2) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
24David Eppstein Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
24Xiao Zhou 0001, Takao Nishizeki Edge-Coloring and f-Coloring for Various Classes of Graphs. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24K. McCroan, Robert Christopher Lacher Region coloring, edge coloring, and scan-conversion of maps. Search on Bibsonomy Int. J. Comput. Geom. Appl. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Hal A. Kierstead Applications of edge coloring of multigraphs to vertex coloring of graphs. Search on Bibsonomy Discret. Math. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
24Stefan A. Burr Some undecidable problems involving the edge-coloring and vertex-coloring of graphs. Search on Bibsonomy Discret. Math. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
21Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano Directed Tree Networks. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bipartite edge coloring, Approximation algorithms, Optical networks, Path coloring
21Ming-Jye Lee, Chi-Chang Chen, Chien-Ning Yeh Permutation Routing in All-Optical Multistage Clos Network. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Optical Crosstalk, Rearrangeable non-blocking, Paull’s Matrix, Edge Coloring, Clos network
21Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos Time slot scheduling of compatible jobs. Search on Bibsonomy J. Sched. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling
21Jihui Wang, Sumei Zhang, Jianfeng Hou On f -Edge Cover-Coloring of Simple Graphs. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Simple graph, f-edge cover-coloring, Edge-coloring
21Kazuhiro Suzuki A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph. Search on Bibsonomy Graphs Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Heterochromatic, Spanning tree, Edge-coloring, Rainbow, Multicolored
21Yongqi Sun, Yuansheng Yang, Feng Xu, Bingxi Li New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m). Search on Bibsonomy Graphs Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Multicolor Ramsey number, Cycle, Edge coloring, Forbidden subgraph
21Shing-Tsaan Huang, Chi-Hung Tzeng Distributed Edge Coloration for Bipartite Networks. Search on Bibsonomy SSS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Fault-tolerance, Distributed system, Self-stabilization, Edge coloring
21Thomas Erlebach, Stamatis Stefanakos Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Wavelength converter placement, Bipartization, Sufficient set, L-reduction, Graph algorithm, Wavelength assignment, Edge coloring
21Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki Finding Edge-Disjoint Paths in Partial k-Trees. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
21Ravi Jain, Kiran Somalwar, John Werth, James C. Browne Heuristics for Scheduling I/O Operations. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Data transfer scheduling, graph edge coloring, I/O bottleneck, multiprocessor operating systems, simultaneous resource scheduling, parallel I/O, scheduling heuristics
21Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). Search on Bibsonomy ISAAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
21Richard Beigel, David Eppstein 3-Coloring in Time O(1.3446n): A No-MIS Algorithm. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT
21Rajeev Motwani 0001, Joseph Naor, Moni Naor The Probabilistic Method Yields Deterministic Parallel Algorithms Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF combinatorial constructions, randomized parallel algorithms, deterministic parallel algorithms, set balancing problem, lattice approximation, random sampling, conditional probabilities, probabilistic method, edge-coloring graphs
21Bonnie Berger, John Rompel Simulating (log ^c n)-wise Independence in NC Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF hypergraph coloring problem, randomness removal, (log/sup c/n)-wise independence, randomized NC algorithms, polylogarithmic independence, RNC algorithms, set discrepancy problem, NC edge-coloring algorithm, simulation
21Marek Kubale Comments on "Decomposition of Permutation Networks". Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1982 DBLP  DOI  BibTeX  RDF Computer complexity, edge coloring, matrix decomposition
21David Eppstein, Michael T. Goodrich, Jeremy Yu Meng Confluent Layered Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur Testing Properties of Constraint-Graphs. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Yossi Chait, C. V. Hollot, Vishal Misra, Donald F. Towsley, Honggang Zhang 0003, Yong Cui Throughput differentiation using coloring at the network edge and preferential marking at the core. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21David Eppstein, Michael T. Goodrich, Jeremy Yu Meng Confluent Layered Drawings. Search on Bibsonomy GD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 563 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license