|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1325 occurrences of 797 keywords
|
|
|
Results
Found 5953 publication records. Showing 5953 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
22 | Fabrizio Frati |
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 133-144, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Tony T. Lee, Terry Y. Lo, Jianfang Wang |
An information-lossless decomposition theory of relational information systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(5), pp. 1890-1903, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis |
Consistency of the Matching Predicate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETN ![In: Advances in Artificial Intelligence, 4th Helenic Conference on AI, SETN 2006, Heraklion, Crete, Greece, May 18-20, 2006, Proceedings, pp. 555-558, 2006, Springer, 3-540-34117-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso |
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 427-439, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Jesper Jansson 0001, Takeshi Tokuyama |
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(2), pp. 205-222, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Steve Chien |
A determinant-based algorithm for counting perfect matchings in a general graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 728-735, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
22 | Raghav Kulkarni, Meena Mahajan |
Seeking a Vertex of the Planar Matching Polytope in NC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 472-483, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Xiang Ji 0001, Hongyuan Zha |
Extracting Shared Topics of Multiple Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 - May 2, 2003, Proceedings, pp. 100-110, 2003, Springer, 3-540-04760-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Eran Halperin, Uri Zwick |
Combinatorial approximation algorithms for the maximum directed cut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 1-7, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 42-51, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Vadim V. Lozin |
On a Generalization of Bi-Complement Reducible Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 528-538, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Marco Riedel |
Online Matching for Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 571-580, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
22 | Kunihiro Fujiyoshi, Yoji Kajitani, Hiroshi Niitsu |
Design of minimum and uniform bipartites for optimum connection blocks of FPGA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(11), pp. 1377-1383, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
22 | Xiaotie Deng |
Distributed Near-Optimal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 135-144, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | Huimin Bian, Andrew C. Ling, Alexander Choong, Jianwen Zhu |
Towards scalable placement for FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 18th International Symposium on Field Programmable Gate Arrays, FPGA 2010, Monterey, California, USA, February 21-23, 2010, pp. 147-156, 2010, ACM, 978-1-60558-911-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
fpga, convex optimization, quadratic placement, bipartite matching |
22 | Bo Bai 0001, Wei Chen 0002, Khaled Ben Letaief, Zhigang Cao 0001 |
RBG matching: an innovative combinatorial approach for OFDMA resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010, Caen, France, June 28 - July 2, 2010, pp. 621-625, 2010, ACM, 978-1-4503-0062-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
random bipartite graph, matching, OFDMA, large deviations, outage probability |
22 | Jinyan Li 0001, Qian Liu, Tao Zeng |
Negative correlations in collaboration: concepts and algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 463-472, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
collaborating negative correlations, transpose closures from a bipartite graph database |
22 | Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 262-273, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs |
22 | Tsuyoshi Murata |
Community Division of Heterogeneous Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 1011-1022, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
community, modularity, bipartite networks |
22 | Ning Zhang |
Topological Structure and Interest Spectrum of the Group Interest Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 729-736, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
para-bipartite graph, group interest spectrum, behavior characteristics, in-degree, Complex network |
22 | Chun-Hua Fu, Yue-Ping Zhou, Xiu-Lian Xu, Hui Chang, Ai-Xia Feng, Jianjun Shi, Da-Ren He |
Recognition of Important Subgraphs in Collaboration Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 210-219, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
shifted power law, bipartite graph, clique, collaboration network, subgraph |
22 | Jeonghee Yi, Farzin Maghoul |
Query clustering using click-through graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, April 20-24, 2009, pp. 1055-1056, 2009, ACM, 978-1-60558-487-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
biclique, click-through graph, equivalence set, maximal bipartite clique, query clustring, query intent |
22 | Frank Gurski, Egon Wanke |
On Module-Composed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 166-177, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs |
22 | A. C. Ramachandra, K. Pavithra, K. Yashasvini, K. B. Raja, K. R. Venugopal 0001, Lalit M. Patnaik |
Offline signature authentication using cross-validated graph matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, Bangalore, India, January 9-10, 2009, pp. 7, 2009, ACM, 978-1-60558-476-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
complete matching, equal error rate, offline signature verification, biometrics, bipartite graph, cross-validation |
22 | Gabriel Marcilio, Luiz C. V. dos Santos, Bruno C. Albertini, Sandro Rigo |
A novel verification technique to uncover out-of-order DUV behaviors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 448-453, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
white-box verification, bipartite graphs |
22 | LingWei Chu, Shihong Zou, Shiduan Cheng, Wendong Wang |
Active probing based Internet service fault management in uncertain and noisy environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(11), pp. 1857-1870, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bipartite Bayesian network, service management, fault management, active probing, binary symmetric channel |
22 | Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church |
Query suggestion using hitting time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 469-478, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
personalized query suggestion, bipartite graph, query suggestion, hitting time |
22 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 280-291, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
22 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001 |
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 15, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
level maximal, Bipartite matching, strong stability, stable marriage |
22 | Chao-Chih Chou, Chin-Mei Fu |
Decomposition of K m , n into 4-cycles and 2 t -cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 205-218, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete bipartite graph, Cycle decomposition |
22 | Ying-Da Chen, Jing-Ho Yan |
A study on cyclic bandwidth sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 295-308, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Proper labeling, Cyclic bandwidth sum, Complete bipartite graph, Cyclic displacement, Zero cycle, Extended labeling, Balanced 2-color, Tree |
22 | Chang-Wu Yu 0001 |
On the Complexity of the Max-Edge-Coloring Problem with Its Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 350-361, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multi-graphs, bipartite graphs, algorithm design, edge coloring |
22 | Nan Yang, Songxiang Lin, Qiang Gao |
An Exhaustive and Edge-Removal Algorithm to Find Cores in Implicit Communities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb/WAIM ![In: Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings, pp. 273-280, 2007, Springer, 978-3-540-72483-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete Bipartite Graph, Link analysis, Web communities |
22 | Jean Frédéric Myoupo, David Semé |
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 38(1), pp. 83-107, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point |
22 | Oren Kurland, Lillian Lee |
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, Washington, USA, August 6-11, 2006, pp. 83-90, 2006, ACM, 1-59593-369-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph-based retrieval, structural re-ranking, clusters, authorities, language modeling, bipartite graph, HITS, hubs, cluster-based language models, high-accuracy retrieval |
22 | Behrooz Parhami, Mikhail A. Rakov |
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 714-724, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width |
22 | Seda Ogrenci Memik, Ryan Kastner, Elaheh Bozorgzadeh, Majid Sarrafzadeh |
A scheduling algorithm for optimization and early planning in high-level synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 10(1), pp. 33-57, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Scheduling, high-level synthesis, data flow graph, bipartite matching |
22 | Henk Bekker, E. P. Braad, Boris Goldengorin |
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 610-613, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
tolerance based bipartite matching, solving polynomial equations, combinatorial optimization |
22 | Ruiqiang Guo, Dehua Chen, Jiajin Le |
Matching Semantic Web Services across Heterogeneous Ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Fifth International Conference on Computer and Information Technology (CIT 2005), 21-23 September 2005, Shanghai, China, pp. 264-268, 2005, IEEE Computer Society, 0-7695-2432-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Ontology, Web Services, Matching, Bipartite Graph, OWL-S |
22 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 205-214, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
22 | David M. Harris |
An Exponentiation Unit for an OpenGL Lighting Engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(3), pp. 251-258, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
OpenGL hardware acceleration, table complexity, bipartite tables, Powering, computer arithmetic, table lookups, exponentiation |
22 | Zhenghao Zhang, Yuanyuan Yang |
Distributed QoS-Aware Scheduling Algorithm for WDM Optical Interconnects with Arbitrary Wavelength Conversion Capability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 33rd International Conference on Parallel Processing (ICPP 2004), 15-18 August 2004, Montreal, Quebec, Canada, pp. 301-308, 2004, IEEE Computer Society, 0-7695-2197-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
weighted bipartite graphs, scheduling, matching, optical interconnects, Wavelength-division-multiplexing (WDM), wavelength conversion, limited range wavelength conversion |
22 | Gabriel Valiente |
Constrained Tree Inclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 361-371, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching |
22 | Zhenghao Zhang, Yuanyuan Yang 0001 |
Distributed Scheduling Algorithms for Wavelength Convertible WDM Optical Interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 72, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
convex bipartite graph, contention-free, distributed algorithms, scheduling algorithms, optical interconnects, Wavelength-division-multiplexing (WDM), optical switches, wavelength conversion, maximum matching, limited range wavelength conversion |
22 | Jan-Jan Wu, Da-Wei Wang 0004, Yih-Fang Lin |
Placement of I/O servers to improve parallel I/O performance on switch-based clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 17th Annual International Conference on Supercomputing, ICS 2003, San Francisco, CA, USA, June 23-26, 2003, pp. 244-251, 2003, ACM, 1-58113-733-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
part-time I/O assignment, switch-based clusters, parallel I/O, bipartite matching |
22 | Guo-Hui Lin, Dong Xu 0002, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen, Ying Xu 0001 |
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 1st IEEE Computer Society Bioinformatics Conference, CSB 2002, Stanford, CA, USA, August 14-16, 2002, pp. 165-174, 2002, IEEE Computer Society, 0-7695-1653-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
chemical shift, peak assignment, combinatorial technique, branch-and-bound, greedy algorithm, protein structure, bipartite matching, NMR |
22 | Hongyuan Zha |
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 11-15, 2002, Tampere, Finland, pp. 113-120, 2002, ACM, 1-58113-561-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
mutual reinforcement principle, singular value decomposition, graph partitioning, bipartite graph, text summarization, keyphrase extraction |
22 | Kim-Lin Chew, Johnny Pang, Qizhang Liu, Jihong Ou, Chung-Piaw Teo |
An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 108(1-4), pp. 111-122, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
set partitioning model, optimization, tabu search, bipartite matching, crew scheduling |
22 | Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. Raghavendra |
Adaptive Communication Algorithms for Distributed Heterogeneous Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing, HPDC '98, Chicago, Illinois, USA, July 28-31, 1998., pp. 310-321, 1998, IEEE Computer Society, 0-8186-8579-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Network-based computing, adaptive communication scheduling, open shop scheduling, bipartite weighted graph matching, all-to-all personalized communication |
22 | Sajal K. Das 0001, Aisheng Mao |
Embeddings in Recursive Combinatorial Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, pp. 184-204, 1992, Springer, 3-540-56402-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
combinatorial networks, full binary trees, congestion-free routing, Interconnection networks, hypercube, embedding, mesh, bipartite graphs |
22 | Isaac D. Scherson |
Orthogonal Graphs for the Construction of a Class of Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(1), pp. 3-19, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
multidimensional access memories, graph theoretical representation, orthogonal binary vectors, link modes, node covering problem, binary m-cube, spanning-bus meshes, orthogonal shared memorymultiprocessing systems, interconnection networks, graph theory, connectivity, placement, bipartite graphs, multiprocessor interconnectionnetworks |
22 | Biing-Feng Wang, Gen-Huey Chen |
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(4), pp. 500-507, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points |
22 | Edward Omiecinski |
Heuristics for Join Processing Using Nonclustered Indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(1), pp. 18-25, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
nonclustered indexes, bipartite graph model, page accesses, database environment, relational databases, relational databases, relations, buffer size, tuples, join processing, query optimisation, access paths |
22 | David Fernández-Baca |
Allocating Modules to Processors in a Distributed System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1427-1436, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
execution costs, P=NP, polynomial-time epsilon -approximate algorithm, optimum assignment, almost-tree, module allocation problem, distributed system, computational complexity, complexity, graph theory, distributed processing, iteration, polynomial time, planar, bipartite, partial k-tree, local search algorithm, communication graph |
19 | Huan Qing, Jingli Wang |
Bipartite mixed membership distribution-free model. A novel model for community detection in overlapping bipartite weighted networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 235, pp. 121088, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Ryan Jeong |
Bipartite Friends and Strangers Walking on Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.03848, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Reza Naserasr, Zhouningxin Wang |
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(12), pp. 113604, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Huan Qing |
Bipartite Mixed Membership Distribution-Free Model. A novel model for community detection in overlapping bipartite weighted networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.00912, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Neeldhara Misra, Saraswati Nanoti |
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.03820, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
19 | Peter Adams 0001, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit |
Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. ICA ![In: Bull. ICA 92, pp. 50-61, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Ilia Ponomarenko, Grigory Ryabov |
The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 37(3), pp. 1089-1102, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Deepak Bal, Patrick Bennett |
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(4), pp. 4, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Yingzhi Tian, Huaping Ma, Liyun Wu |
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 30(3), pp. 2040005:1-2040005:9, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki |
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(1), pp. 167-176, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Binlong Li |
Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(6), pp. 1639-1653, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Bernardo M. Ábrego, Silvia Fernández-Merchant, Athena Sparks |
The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(2), pp. 205-220, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Jun Ge, Fengming Dong |
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 283, pp. 542-554, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Furong Chang, Bofeng Zhang, Yue Zhao 0014, Songxian Wu, Guobing Zou, Sen Niu |
Overlapping Community Detection in Bipartite Networks using a Micro-bipartite Network Model: Bi-EgoNet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 37(6), pp. 7965-7976, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Jing-Xin Guan, Jian-Hua Yin |
The bipartite-splittance of a bipartite graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 39(1), pp. 23-29, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Furong Chang, Bofeng Zhang, Yue Zhao 0014, Songxian Wu, Kenji Yoshigoe |
Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-Bipartite Network Bi-Egonet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 91488-91498, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Mikio Mizukami, Kouichi Hirata, Tetsuji Kuboyama |
Bipartite Edge Correlation Clustering: Finding an Edge Biclique Partition from a Bipartite Graph with Minimum Disagreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPRAM ![In: Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2019, Prague, Czech Republic, February 19-21, 2019., pp. 699-706, 2019, SciTePress, 978-989-758-351-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Mehdi Ghiyasvand |
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 229(1), pp. 397-408, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Yao-Min Di, Hai-Rui Wei, Ya Cao, Li Liu, Chun-Hong Zhou |
Entangling capability of multivalued bipartite gates and optimal preparation of multivalued bipartite quantum states. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 14(6), pp. 1997-2012, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Andrew Gainer-Dewar, Ira M. Gessel |
Enumeration of Bipartite Graphs and Bipartite Blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 21(2), pp. 2, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Oleg Duginov |
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 16(3), pp. 203-214, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Jérémie Chalopin, Daniël Paulusma |
Packing bipartite graphs with covers of complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 168, pp. 40-50, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Jing Shi, Jian Wang 0104, Beiliang Du |
On bipartite factorization of complete bipartite multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 108, pp. 481-491, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
19 | Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little |
A characterization of PM-compact bipartite and near-bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(6), pp. 772-783, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | B. S. Panda 0001, Dinabandhu Pradhan |
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 26(4), pp. 770-785, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Hervé Moulin 0001, Jay Sethuraman |
Loss calibrated methods for bipartite rationing: bipartite rationing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013, pp. 697-714, 2013, ACM, 978-1-4503-1962-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Min Lu, Tian Liu 0001, Ke Xu 0001 |
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW-AAIM ![In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pp. 142-152, 2013, Springer, 978-3-642-38755-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Rui Duarte |
Constructions of Bipartite and Bipartite-regular Hypermaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 19(4), pp. 2, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Marina Groshaus, Jayme Luiz Szwarcfiter |
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 45(3), pp. 209-222, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Aydin Seçer |
Ontoloji haritalamada iki parçalı (Bipartite) çizge tabanlı yaklaşım (Bipartite graph based ontology mapping) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2011 |
RDF |
|
19 | David E. Brown, Arthur H. Busch, Garth Isaak |
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 12(5), pp. 63-82, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Xin Liu 0020, Tsuyoshi Murata |
An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Adv. Comput. Intell. Intell. Informatics ![In: J. Adv. Comput. Intell. Intell. Informatics 14(4), pp. 408-415, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Jérémie Chalopin, Daniël Paulusma |
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, pp. 276-287, 2010, Springer, 978-3-642-13072-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Guizhen Liu, Jianbo Qian, Jonathan Z. Sun, Rui Xu |
Bipartite Toughness and k-Factors in Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2008, pp. 597408:1-597408:8, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Petros A. Petrosyan, Gagik H. Karapetyan |
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0712.4148, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
19 | Nigel Martin |
Unbalanced bipartite factorizations of complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 306(17), pp. 2084-2090, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Terry A. McKee |
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 260(1-3), pp. 231-238, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Romeo Rizzi |
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 15(3), pp. 283-288, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Hong Wang 0005 |
On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 15(3), pp. 353-364, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Kasturi R. Varadarajan, Pankaj K. Agarwal |
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA., pp. 805-814, 1999, ACM/SIAM, 0-89871-434-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
19 | Nigel Martin |
Complete bipartite factorisations by complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 167-168, pp. 461-480, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Hong Wang 0005 |
Packing two bipartite graphs into a complete bipartite graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 26(2), pp. 95-104, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Peter C. Fishburn, Peter L. Hammer |
Bipartite dimensions and bipartite degrees of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 160(1-3), pp. 127-148, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz |
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 6(2), pp. 189-196, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Odile Favaron, Pedro Mago, Oscar Ordaz |
On the bipartite independence number of a balanced bipartite graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 121(1-3), pp. 55-63, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
17 | Shing-Tsaan Huang, Chi-Hung Tzeng |
Distributed edge coloration for bipartite networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 22(1), pp. 3-14, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Distributed system, Self-stabilization, Edge coloring |
Displaying result #201 - #300 of 5953 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|