Belyi, Alexander; Sobolevsky, Stanislav; Kurbatski, Alexander; Ratti, Carlo Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem. (English) Zbl 1526.05060 Math. Methods Oper. Res. 98, No. 2, 269-297 (2023). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C22 05C85 68T09 68R10 90C35 90C05 90C90 91C20 PDFBibTeX XMLCite \textit{A. Belyi} et al., Math. Methods Oper. Res. 98, No. 2, 269--297 (2023; Zbl 1526.05060) Full Text: DOI arXiv OA License
Jonnalagadda, Annapurna; Kuppusamy, Lakshmanan A cooperative game framework for detecting overlapping communities in social networks. (English) Zbl 1514.91145 Physica A 491, 498-515 (2018). MSC: 91D30 91A12 91A43 PDFBibTeX XMLCite \textit{A. Jonnalagadda} and \textit{L. Kuppusamy}, Physica A 491, 498--515 (2018; Zbl 1514.91145) Full Text: DOI
Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness. (English) Zbl 1493.68398 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 14, 16 p. (2018). MSC: 68W25 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{W. Nadara} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 14, 16 p. (2018; Zbl 1493.68398) Full Text: DOI arXiv
Chalupa, David An order-based algorithm for minimum dominating set with application in graph mining. (English) Zbl 1436.68224 Inf. Sci. 426, 101-116 (2018). MSC: 68R10 05C69 05C82 05C85 68T20 68W20 PDFBibTeX XMLCite \textit{D. Chalupa}, Inf. Sci. 426, 101--116 (2018; Zbl 1436.68224) Full Text: DOI arXiv
Micale, Giovanni; Giugno, Rosalba; Ferro, Alfredo; Mongiovì, Misael; Shasha, Dennis; Pulvirenti, Alfredo Fast analytical methods for finding significant labeled graph motifs. (English) Zbl 1411.68115 Data Min. Knowl. Discov. 32, No. 2, 504-531 (2018). MSC: 68T05 05C80 05C85 68R10 92C42 PDFBibTeX XMLCite \textit{G. Micale} et al., Data Min. Knowl. Discov. 32, No. 2, 504--531 (2018; Zbl 1411.68115) Full Text: DOI
Knueven, Ben; Ostrowski, Jim; Pokutta, Sebastian Detecting almost symmetries of graphs. (English) Zbl 1400.05160 Math. Program. Comput. 10, No. 2, 143-185 (2018). MSC: 05C60 05C85 90C27 PDFBibTeX XMLCite \textit{B. Knueven} et al., Math. Program. Comput. 10, No. 2, 143--185 (2018; Zbl 1400.05160) Full Text: DOI
Li, Zichao; Mucha, Peter J.; Taylor, Dane Network-ensemble comparisons with stochastic rewiring and von Neumann entropy. (English) Zbl 1414.94851 SIAM J. Appl. Math. 78, No. 2, 897-920 (2018). MSC: 94A17 05C82 60F05 60J10 62M02 28D20 PDFBibTeX XMLCite \textit{Z. Li} et al., SIAM J. Appl. Math. 78, No. 2, 897--920 (2018; Zbl 1414.94851) Full Text: DOI arXiv
Žalik, Krista Rizman Community detection in networks using new update rules for label propagation. (English) Zbl 1382.68184 Computing 99, No. 7, 679-700 (2017). MSC: 68R10 05C82 91D30 PDFBibTeX XMLCite \textit{K. R. Žalik}, Computing 99, No. 7, 679--700 (2017; Zbl 1382.68184) Full Text: DOI
Meghanathan, Natarajan Retracted article: “A distance vector similarity metric for complex networks”. (English) Zbl 1472.68118 Computing 99, No. 11, 1147 (2017). MSC: 68R10 05C82 PDFBibTeX XMLCite \textit{N. Meghanathan}, Computing 99, No. 11, 1147 (2017; Zbl 1472.68118) Full Text: DOI
Bian, Tian; Deng, Yong A new evidential methodology of identifying influential nodes in complex networks. (English) Zbl 1375.05251 Chaos Solitons Fractals 103, 101-110 (2017). MSC: 05C82 PDFBibTeX XMLCite \textit{T. Bian} and \textit{Y. Deng}, Chaos Solitons Fractals 103, 101--110 (2017; Zbl 1375.05251) Full Text: DOI
Gronemann, Martin; Jünger, Michael Drawing clustered graphs as topographic maps. (English) Zbl 1377.68178 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 426-438 (2013). MSC: 68R10 05C82 68U05 PDFBibTeX XMLCite \textit{M. Gronemann} and \textit{M. Jünger}, Lect. Notes Comput. Sci. 7704, 426--438 (2013; Zbl 1377.68178) Full Text: DOI
Shi, Quan; Xiao, Yanghua; Bessis, Nik; Lu, Yiqi; Chen, Yaoliang; Hill, Richard Optimizing \(K^2\) trees: a case for validating the maturity of network of practices. (English) Zbl 1238.90132 Comput. Math. Appl. 63, No. 2, 427-436 (2012). MSC: 90C35 68P15 05C82 68M11 91D30 PDFBibTeX XMLCite \textit{Q. Shi} et al., Comput. Math. Appl. 63, No. 2, 427--436 (2012; Zbl 1238.90132) Full Text: DOI
Bachmaier, Christian; Brandenburg, Franz Josef; Effinger, Philip; Gutwenger, Carsten; Katajainen, Jyrki; Klein, Karsten; Spönemann, Miro; Stegmaier, Matthias; Wybrow, Michael The Open Graph Archive: a community-driven effort. (English) Zbl 1311.68102 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 435-440 (2012). MSC: 68R10 05C85 05C99 68U35 PDFBibTeX XMLCite \textit{C. Bachmaier} et al., Lect. Notes Comput. Sci. 7034, 435--440 (2012; Zbl 1311.68102) Full Text: DOI arXiv
Edmonds, Nick; Breuer, Alex; Gregor, Douglas; Lumsdaine, Andrew Single-source shortest paths with the parallel boost graph library. (English) Zbl 1209.05239 Demetrescu, Camil (ed.) et al., The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13–14, 2006. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4383-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 74, 219-248 (2009). MSC: 05C85 05C35 90C35 PDFBibTeX XMLCite \textit{N. Edmonds} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 74, 219--248 (2009; Zbl 1209.05239)
Agarwal, G.; Kempe, D. Modularity-maximizing graph communities via mathematical programming. (English) Zbl 1188.90262 Eur. Phys. J. B, Condens. Matter Complex Syst. 66, No. 3, 409-418 (2008). MSC: 90C35 91D10 05C90 90B10 PDFBibTeX XMLCite \textit{G. Agarwal} and \textit{D. Kempe}, Eur. Phys. J. B, Condens. Matter Complex Syst. 66, No. 3, 409--418 (2008; Zbl 1188.90262) Full Text: DOI arXiv
Deville, Yves; Dooms, Grégoire; Zampelli, Stéphane Combining two structured domains for modeling various graph matching problems. (English) Zbl 1162.68652 Fages, François (ed.) et al., Recent advances in constraints. 12th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2007, Rocquencourt, France, June 7–8, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89811-5/pbk). Lecture Notes in Computer Science 5129. Lecture Notes in Artificial Intelligence, 76-90 (2008). MSC: 68T20 68R10 PDFBibTeX XMLCite \textit{Y. Deville} et al., Lect. Notes Comput. Sci. 5129, 76--90 (2008; Zbl 1162.68652) Full Text: DOI
Antonić, Nenad; Burazin, Krešimir Graph representation for asymptotic expansion in homogenisation of nonlinear first-order equations. (English) Zbl 1180.35066 Ann. Univ. Ferrara, Sez. VII, Sci. Mat. 53, No. 2, 149-176 (2007). MSC: 35B27 05C90 35F20 PDFBibTeX XMLCite \textit{N. Antonić} and \textit{K. Burazin}, Ann. Univ. Ferrara, Sez. VII, Sci. Mat. 53, No. 2, 149--176 (2007; Zbl 1180.35066) Full Text: DOI
Zheng, Lanbo; Buchheim, Christoph A new exact algorithm for the two-sided crossing minimization problem. (English) Zbl 1175.05129 Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 301-310 (2007). MSC: 05C85 05C10 90C57 PDFBibTeX XMLCite \textit{L. Zheng} and \textit{C. Buchheim}, Lect. Notes Comput. Sci. 4616, 301--310 (2007; Zbl 1175.05129) Full Text: DOI
Suderman, Matthew; Whitesides, Sue Experiments with the fixed-parameter approach for two-layer planarization. (English) Zbl 1089.05068 J. Graph Algorithms Appl. 9, No. 1, 149-163 (2005). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Suderman} and \textit{S. Whitesides}, J. Graph Algorithms Appl. 9, No. 1, 149--163 (2005; Zbl 1089.05068) Full Text: DOI EuDML
Belli, Fevzi; Budnik, Christof J. Minimal spanning set for coverage testing of interactive systems. (English) Zbl 1108.68417 Liu, Zhiming (ed.) et al., Theoretical aspects of computing – ICTAC 2004. First international colloquium, Guiyang, China, September 20–24, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-25304-1/pbk). Lecture Notes in Computer Science 3407, 220-234 (2005). MSC: 68N99 68R10 PDFBibTeX XMLCite \textit{F. Belli} and \textit{C. J. Budnik}, Lect. Notes Comput. Sci. 3407, 220--234 (2005; Zbl 1108.68417) Full Text: DOI
Barth, Wilhelm; Mutzel, Petra; Jünger, Michael Simple and efficient bilayer cross counting. (English) Zbl 1088.05502 J. Graph Algorithms Appl. 8, No. 2, 179-194 (2004). MSC: 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{W. Barth} et al., J. Graph Algorithms Appl. 8, No. 2, 179--194 (2004; Zbl 1088.05502) Full Text: DOI EuDML
Martí, Rafael; Laguna, Manuel Heuristics and meta-heuristics for 2-layer straight line crossing minimization. (English) Zbl 1019.68080 Discrete Appl. Math. 127, No. 3, 665-678 (2003). MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{R. Martí} and \textit{M. Laguna}, Discrete Appl. Math. 127, No. 3, 665--678 (2003; Zbl 1019.68080) Full Text: DOI
Newton, Matthew; Sýkora, Ondrej; Vrt’o, Imrich Two new heuristics for two-sided bipartite graph drawing. (English) Zbl 1037.68594 Goodrich, Michael T. (ed.) et al., Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002. Revised papers. Berlin: Springer (ISBN 3-540-00158-1/pbk). Lect. Notes Comput. Sci. 2528, 312-319 (2002). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{M. Newton} et al., Lect. Notes Comput. Sci. 2528, 312--319 (2002; Zbl 1037.68594) Full Text: Link
Gajer, Pawel; Kobourov, Stephen G. GRIP: Graph drawing with intelligent placement. (English) Zbl 1027.68099 J. Graph Algorithms Appl. 6, No. 3, 203-224 (2002). MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{P. Gajer} and \textit{S. G. Kobourov}, J. Graph Algorithms Appl. 6, No. 3, 203--224 (2002; Zbl 1027.68099) Full Text: DOI EuDML
Larrosa, Javier; Valiente, Gabriel Constraint satisfaction algorithms for graph pattern matching. (English) Zbl 1009.68103 Math. Struct. Comput. Sci. 12, No. 4, 403-422 (2002). MSC: 68R10 68T10 68Q25 PDFBibTeX XMLCite \textit{J. Larrosa} and \textit{G. Valiente}, Math. Struct. Comput. Sci. 12, No. 4, 403--422 (2002; Zbl 1009.68103) Full Text: DOI
Hansen, Pierre; Mélot, Hadrien Computers and discovery in algebraic graph theory. (English) Zbl 1015.05087 Linear Algebra Appl. 356, No. 1-3, 211-230 (2002). MSC: 05C85 PDFBibTeX XMLCite \textit{P. Hansen} and \textit{H. Mélot}, Linear Algebra Appl. 356, No. 1--3, 211--230 (2002; Zbl 1015.05087) Full Text: DOI
Krishnan, Radha; Raghavachari, Balaji The directed minimum-degree spanning tree problem. (English) Zbl 1052.68642 Hariharan, Ramesh (ed.) et al., FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13–15, 2001. Proceedings. Berlin: Springer (ISBN 3-540-43002-4). Lect. Notes Comput. Sci. 2245, 232-243 (2001). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{R. Krishnan} and \textit{B. Raghavachari}, Lect. Notes Comput. Sci. 2245, 232--243 (2001; Zbl 1052.68642) Full Text: Link
Chen, Ding-Yi; Chuang, Tyng-Ruey; Tsai, Shi-Chun JGAP: a Java-based graph algorithms platform. (English) Zbl 1009.68885 Software. Practice & Experience 31, No. 7, 615-635 (2001). MSC: 68U99 68N15 05C85 PDFBibTeX XMLCite \textit{D.-Y. Chen} et al., Softw., Pract. Exper. 31, No. 7, 615--635 (2001; Zbl 1009.68885) Full Text: DOI
Caramia, Massimiliano; Dell’Olmo, Paolo Solving the minimum-weighted coloring problem. (English) Zbl 0983.68150 Networks 38, No. 2, 88-101 (2001). MSC: 68R10 05C15 PDFBibTeX XMLCite \textit{M. Caramia} and \textit{P. Dell'Olmo}, Networks 38, No. 2, 88--101 (2001; Zbl 0983.68150) Full Text: DOI
Mutzel, Petra An alternative method to crossing minimization on hierarchical graphs. (English) Zbl 1010.90098 SIAM J. Optim. 11, No. 4, 1065-1080 (2001). MSC: 90C57 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Mutzel}, SIAM J. Optim. 11, No. 4, 1065--1080 (2001; Zbl 1010.90098) Full Text: DOI
Aingworth, D.; Chekuri, C.; Indyk, P.; Motwani, R. Fast estimation of diameter and shortest paths (Without matrix multiplication). (English) Zbl 0926.68093 SIAM J. Comput. 28, No. 4, 1167-1181 (1999). MSC: 68R10 05C85 68W10 05C12 05C50 PDFBibTeX XMLCite \textit{D. Aingworth} et al., SIAM J. Comput. 28, No. 4, 1167--1181 (1999; Zbl 0926.68093) Full Text: DOI
Fialko, Sergej; Mutzel, Petra A new approximation algorithm for the planar augmentation problem. (English) Zbl 0929.68082 Proceedings of the 9th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 25–27, 1998. Philadelphia, PA: SIAM. 260-269 (1998). MSC: 68R10 PDFBibTeX XMLCite \textit{S. Fialko} and \textit{P. Mutzel}, in: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms, SODA '98. San Francisco, CA, USA, January 25--27, 1998. Philadelphia, PA: SIAM. 260--269 (1998; Zbl 0929.68082)
Crauser, A.; Mehlhorn, K.; Meyer, U.; Sanders, P. A parallelization of Dijkstra’s shortest path algorithm. (English) Zbl 0912.05056 Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 722-731 (1998). Reviewer: A.Kapralski (Kraków) MSC: 05C85 05C80 68R10 PDFBibTeX XMLCite \textit{A. Crauser} et al., Lect. Notes Comput. Sci. 1450, 722--731 (1998; Zbl 0912.05056)
Jünger, Michael; Mutzel, Petra 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. (English) Zbl 0906.05068 J. Graph Algorithms Appl. 1, Paper 1, 25 p. (1997). Reviewer: H.Müller (Jena) MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{M. Jünger} and \textit{P. Mutzel}, J. Graph Algorithms Appl. 1, Paper 1, 25 p. (1997; Zbl 0906.05068) Full Text: DOI EuDML
Grossman, Jerrold W.; Ion, Patrick D. F. On a portion of the well-known collaboration graph. (English) Zbl 0903.05046 Congr. Numerantium 108, 129-131 (1995). Reviewer: R.Faudree (Memphis) MSC: 05C99 01A70 PDFBibTeX XMLCite \textit{J. W. Grossman} and \textit{P. D. F. Ion}, Congr. Numerantium 108, 129--131 (1995; Zbl 0903.05046)
Knuth, Donald E. The Stanford GraphBase: A platform for combinatorial algorithms. (English) Zbl 0806.68121 Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 41-43 (1993). Reviewer: D.E.Knuth MSC: 68U99 68R10 05C85 68-04 PDFBibTeX XMLCite \textit{D. E. Knuth}, in: Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 41--43 (1993; Zbl 0806.68121)