Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link
13	Yuqi Liu, Zhihao Yang, Jinzhong Ning, Zhijun Wang, Ling Luo 0001, Lei Wang 0085, Yin Zhang, Wei Liu, Hongfei Lin, Jian Wang	Joint Biomedical Entity and Relation Extraction Based on Triple Region Vertices.	BIBM	2023	DBLP DOI BibTeX RDF
13	Noam Razin, Tom Verbin, Nadav Cohen	On the Ability of Graph Neural Networks to Model Interactions Between Vertices.	NeurIPS	2023	DBLP BibTeX RDF
13	Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang	An Approximation Algorithm for Covering Vertices by 4+-Paths.	COCOA (1)	2023	DBLP DOI BibTeX RDF
13	Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha	Exactly k MSTs: How Many Vertices Suffice?	COCOA (1)	2023	DBLP DOI BibTeX RDF
13	Luisa Gargano, Adele A. Rescigno	Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity.	SIROCCO	2023	DBLP DOI BibTeX RDF
13	Koyo Hayashi	Linking four vertices in graphs of large connectivity.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
13	Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost	Minimum Number of Edges of Polytopes with $2d+2$ Vertices.	Electron. J. Comb.	2022	DBLP DOI BibTeX RDF
13	Milica Milivojevic Danas, Ljiljana Pavlovic	On the extremal geometric-arithmetic graphs with fixed number of vertices having minimum degree.	Ann. Oper. Res.	2022	DBLP DOI BibTeX RDF
13	Meibiao Zou, Zhifeng Wang, Jianxin Wang 0001, Yixin Cao 0001	End vertices of graph searches on bipartite graphs.	Inf. Process. Lett.	2022	DBLP DOI BibTeX RDF
13	Antoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey	Trees whose even-degree vertices induce a path are antimagic.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
13	Tjasa Paj Erker, Simon Spacapan	Separation of Cartesian products of graphs into several connected components by the removal of vertices.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
13	Nesrine Azizi, Imed Boudabbous, Abdeljelil Salhi	Minimal Duo-free Digraphs for One or Two Vertices.	J. Multiple Valued Log. Soft Comput.	2022	DBLP BibTeX RDF
13	Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka	Exact Distance Oracles for Planar Graphs with Failing Vertices.	ACM Trans. Algorithms	2022	DBLP DOI BibTeX RDF
13	Yoshiki Satotani, Tsuyoshi Migita, Norikazu Takahashi	An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge.	J. Complex Networks	2022	DBLP DOI BibTeX RDF
13	Savari Prabhu, V. Manimozhi, M. Arulperumjothi, Sandi Klavzar	Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks.	Appl. Math. Comput.	2022	DBLP DOI BibTeX RDF
13	Hongwei Qiao, Jixiang Meng, Eminjan Sabir	Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle.	Appl. Math. Comput.	2022	DBLP DOI BibTeX RDF
13	Jianwei Du, Xiaoling Sun	Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices.	Appl. Math. Comput.	2022	DBLP DOI BibTeX RDF
13	Simone Traverso, Niccolò Traverso Ziani, Maura Sassetti	Effects of the Vertices on the Topological Bound States in a Quasicrystalline Topological Insulator.	Symmetry	2022	DBLP DOI BibTeX RDF
13	Guillermo Pineda-Villavicencio, David T. Yost	The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta	Minimal Ramsey Graphs with Many Vertices of Small Degree.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov	Maximal origami flip graphs of flat-foldable vertices: properties and algorithms.	J. Graph Algorithms Appl.	2022	DBLP DOI BibTeX RDF
13	Yufeng Tian, Zhanshan Wang	A Switched Vertices Approach to Stability Analysis of Delayed Markov Jump Systems With Time-Varying Transition Rates.	IEEE Trans. Circuits Syst. II Express Briefs	2022	DBLP DOI BibTeX RDF
13	Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara	Ununfoldable polyhedra with 6 vertices or 6 faces.	Comput. Geom.	2022	DBLP DOI BibTeX RDF
13	Andrew Newman	A Lower Bound on the Number of Homotopy Types of Simplicial Complexes on N Vertices.	Comb.	2022	DBLP DOI BibTeX RDF
13	Guozhen Rong, Yixin Cao 0001, Jian-xin Wang 0001, Zhifeng Wang	Graph Searches and Their End Vertices.	Algorithmica	2022	DBLP DOI BibTeX RDF
13	Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu	Smallest number of vertices in a 2-arc-strong digraph without good pairs.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
13	Xu Jiang 0004, Nan Guan, Maolin Yang, Yang Wang, Yue Tang 0001, Wang Yi 0001	Real-Time Scheduling of Parallel Task Graphs With Critical Sections Across Different Vertices.	IEEE Trans. Parallel Distributed Syst.	2022	DBLP DOI BibTeX RDF
13	Guanghui Hu, Chun Wang, Sijin Li, Wen Dai, Liyang Xiong, Guoan Tang, Josef Strobl	Using vertices of a triangular irregular network to calculate slope and aspect.	Int. J. Geogr. Inf. Sci.	2022	DBLP DOI BibTeX RDF
13	Maya Nabila, Hilda Assiyatun, Edy Tri Baskoro	Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star.	Electron. J. Graph Theory Appl.	2022	DBLP DOI BibTeX RDF
13	Eckhard Steffen, Isaak H. Wolf	Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
13	Marián Klesc, Michal Stas, Jana Petrillová	The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
13	Guido Montúfar, Yue Ren, Leon Zhang	Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums.	SIAM J. Appl. Algebra Geom.	2022	DBLP DOI BibTeX RDF
13	Somesh Singh 0001, Tejas Shah, Rupesh Nasre	ParTBC: Faster Estimation of Top-k Betweenness Centrality Vertices on GPU.	ACM Trans. Design Autom. Electr. Syst.	2022	DBLP DOI BibTeX RDF
13	Torben Fetzer, Gerd Reis, Didier Stricker	INV-Flow2PoseNet: Light-Resistant Rigid Object Pose from Optical Flow of RGB-D Images using Images, Normals and Vertices.	CoRR	2022	DBLP DOI BibTeX RDF
13	Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski	List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs.	CoRR	2022	DBLP DOI BibTeX RDF
13	Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi 0001, Yu Yokoi	Maintaining Optimality in Assignment Problem against Weight Updates around Vertices.	CoRR	2022	DBLP DOI BibTeX RDF
13	Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff 0001	Outside-Obstacle Representations with All Vertices on the Outer Face.	CoRR	2022	DBLP BibTeX RDF
13	Mathieu Roget, Hachem Kadri, Giuseppe Di Molfetta	Spatial search with multiple marked vertices is optimal for almost all queries and its quantum advantage is not always guaranteed.	CoRR	2022	DBLP BibTeX RDF
13	Noam Razin, Tom Verbin, Nadav Cohen	On the Ability of Graph Neural Networks to Model Interactions Between Vertices.	CoRR	2022	DBLP DOI BibTeX RDF
13	Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer	Covering Many (or Few) Edges with k Vertices in Sparse Graphs.	CoRR	2022	DBLP BibTeX RDF
13	Louis Carpentier, Jorik Jooken, Jan Goedgebeur	A heuristic algorithm for the maximum happy vertices problem using tree decompositions.	CoRR	2022	DBLP DOI BibTeX RDF
13	Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov	Maximal origami flip graphs of flat-foldable vertices: properties and algorithms.	CoRR	2022	DBLP DOI BibTeX RDF
13	Lorenzo Balzotti, Paolo Giulio Franciosa	Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs.	CoRR	2022	DBLP BibTeX RDF
13	Jérémy Lavollée, Konrad J. Swanepoel	The number of small-degree vertices in matchstick graphs.	CoRR	2022	DBLP DOI BibTeX RDF
13	Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon	Search-Space Reduction via Essential Vertices.	CoRR	2022	DBLP DOI BibTeX RDF
13	Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal	Walking on Vertices and Edges by Continuous-Time Quantum Walk.	CoRR	2022	DBLP DOI BibTeX RDF
13	Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano	Approximation algorithms for covering vertices by long paths.	CoRR	2022	DBLP DOI BibTeX RDF
13	Dmitry V. Gribanov, Dmitriy S. Malyshev, I. A. Shumilov	On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices.	CoRR	2022	DBLP DOI BibTeX RDF
13	Dhananjay R. Thiruvady, Rhyd Lewis	Recombinative approaches for the maximum happy vertices problem.	Swarm Evol. Comput.	2022	DBLP DOI BibTeX RDF
13	Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius	Avoidable vertices and edges in graphs: Existence, characterization, and applications.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero	On vertices contained in all or in no metric basis.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Michael Fuchs 0001, En-Yu Huang, Guan-Ru Yu	Counting phylogenetic networks with few reticulation vertices: A second approach.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Syafrizal Sy	On size multipartite Ramsey numbers of large paths versus wheel on five vertices.	Discret. Math. Algorithms Appl.	2022	DBLP DOI BibTeX RDF
13	Omer Farooq, Michal Lawniczak, Afshin Akhshani, Szymon Bauch, Leszek Sirko	The Generalized Euler Characteristics of the Graphs Split at Vertices.	Entropy	2022	DBLP DOI BibTeX RDF
13	Oleg V. Borodin, Anna O. Ivanova	Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.	Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Chaohui Chen, Muhuo Liu, Xiaofeng Gu, Kinkar Chandra Das	Extremal augmented Zagreb index of trees with given numbers of vertices and leaves.	Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Kiyoshi Ando	Contractible edges and liftable vertices in a 4-connected graph.	Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Hiranmoy Pal	Laplacian state transfer on graphs with an edge perturbation between twin vertices.	Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Lukasz Bozyk, Andrzej Grzesik, Bartlomiej Kielak	On the inducibility of oriented graphs on four vertices.	Discret. Math.	2022	DBLP DOI BibTeX RDF
13	Torben Fetzer, Gerd Reis, Didier Stricker	INV-Flow2PoseNet: Light-Resistant Rigid Object Pose from Optical Flow of RGB-D Images Using Images, Normals and Vertices.	Sensors	2022	DBLP DOI BibTeX RDF
13	Andrey Bochkarev, Aleksandr Zemlyanukhin, Alexander P. Chetverikov, Manuel G. Velarde	Single and multi-vertices solitons in lattices of active Morse - van der Pol units.	Commun. Nonlinear Sci. Numer. Simul.	2022	DBLP DOI BibTeX RDF
13	Satoru Iwasaki, Shuichi Jimbo, Yoshihisa Morita	Standing Waves of Reaction-Diffusion Equations on an Unbounded Graph with Two Vertices.	SIAM J. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Qinghong Zhao, Bing Wei 0001	Gallai-Ramsey numbers for graphs with five vertices and chromatic number four.	Australas. J Comb.	2022	DBLP BibTeX RDF
13	Tingting Ji, Naiqiao Pan, Tian Chen, Xiangdong Zhang	Fast quantum search of multiple vertices based on electric circuits.	Quantum Inf. Process.	2022	DBLP DOI BibTeX RDF
13	A. Janabekova, G. A. Kabatiansky, Ibrahim Kamel, Tamer F. Rabie	Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory.	Probl. Inf. Transm.	2022	DBLP DOI BibTeX RDF
13	Phuc Do	Finding All Shortest Meaningful Meta-Paths Between Two Vertices of a Secured Large Heterogeneous Information Network Using Distributed Algorithm.	Robotics and AI for Cybersecurity and Critical Infrastructure in Smart Cities	2022	DBLP DOI BibTeX RDF
13	Wenxin Jiang, Bolun Chen, Zifan Qi, Yongtao Yu	Link Prediction Based on Sampled Single Vertices.	ICAIS (1)	2022	DBLP DOI BibTeX RDF
13	Sijia Wang, Shumei Zhang	Vertices Independent Component Analysis-based Status Monitoring Strategy for Processes with Uncertainties.	I2MTC	2022	DBLP DOI BibTeX RDF
13	Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon	Search-Space Reduction via Essential Vertices.	ESA	2022	DBLP DOI BibTeX RDF
13	Kyunghyun Kim, Mingu Jeon, Soohyun Shin, Seong-Woo Kim	Finding Second Hierarchy Point for Cooperative Multi-Vehicles using P-median and Voronoi Diagram Vertices.	ICEIC	2022	DBLP DOI BibTeX RDF
13	Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano	Approximation Algorithms for Covering Vertices by Long Paths.	MFCS	2022	DBLP DOI BibTeX RDF
13	Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices.	MFCS	2022	DBLP DOI BibTeX RDF
13	Dante Durrman, Erik Saule	Coloring the Vertices of 9-pt and 27-pt Stencils with Intervals.	IPDPS	2022	DBLP DOI BibTeX RDF
13	Ran Bi 0001, Qingqiang He, Jinghao Sun, Zhenyu Sun 0002, Zhishan Guo, Nan Guan, Guozhen Tan	Response Time Analysis for Prioritized DAG Task with Mutually Exclusive Vertices.	RTSS	2022	DBLP DOI BibTeX RDF
13	Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff 0001	Outside-Obstacle Representations with All Vertices on the Outer Face.	GD	2022	DBLP DOI BibTeX RDF
13	Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer	Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.	STACS	2022	DBLP DOI BibTeX RDF
13	Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer	On Critical Node Problems with Vulnerable Vertices.	IWOCA	2022	DBLP DOI BibTeX RDF
13	Dimbinaina Ralaivaosaona	The Number of Sources and Isolated Vertices in Random Directed Acyclic Graphs.	AofA	2022	DBLP DOI BibTeX RDF
13	Charis Papadopoulos, Athanasios E. Zisis	Computing and Listing Avoidable Vertices and Paths.	LATIN	2022	DBLP DOI BibTeX RDF
13	Viktor Levandovskyy, Christian Eder, Andreas Steenpass, Simon Schmidt, Julien Schanz, Moritz Weber	Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach.	ISSAC	2022	DBLP DOI BibTeX RDF
13	Ali Gholami Rudi	Place the Vertices Anywhere on the Curve and Simplify.	Fundam. Informaticae	2021	DBLP DOI BibTeX RDF
13	Sergei Avdonin, Julian Edward	An inverse problem for quantum trees with observations at interior vertices.	Networks Heterog. Media	2021	DBLP DOI BibTeX RDF
13	Shinya Fujita 0001, Sergey Kitaev, Shizuka Sato, Li-Da Tong	On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph.	Order	2021	DBLP DOI BibTeX RDF
13	Iskander Aliev, Marcel Celaya, Martin Henk, Aled Williams	Distance-Sparsity Transference for Vertices of Corner Polyhedra.	SIAM J. Optim.	2021	DBLP DOI BibTeX RDF
13	Naoto Ohsaka	A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph.	Inf. Process. Lett.	2021	DBLP DOI BibTeX RDF
13	Roberto Cruz, Juan Rada, José María Sigarreta	Sombor index of trees with at most three branch vertices.	Appl. Math. Comput.	2021	DBLP DOI BibTeX RDF
13	Michael A. Henning, Pawaton Kaemawichanurat	Connected domination critical graphs with a block having maximum number of cut vertices.	Appl. Math. Comput.	2021	DBLP DOI BibTeX RDF
13	Darko Dimitrov, Zhibin Du	A solution of the conjecture about big vertices of minimal-ABC trees.	Appl. Math. Comput.	2021	DBLP DOI BibTeX RDF
13	Ronald Manríquez, Camilo Guerrero-Nancuante, Felipe Martínez, Carla Taramasco	A Generalization of the Importance of Vertices for an Undirected Weighted Graph.	Symmetry	2021	DBLP DOI BibTeX RDF
13	Laurent Feuilloley, Michel Habib	Graph Classes and Forbidden Patterns on Three Vertices.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý 0001	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Lon H. Mitchell	Propagation tree decompositions and linearly independent vertices.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
13	Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot	Constrained routing between non-visible vertices.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
13	Yuanyuan Meng, Xiyu Liu 0001	Finding Central Vertices and Community Structure via Extended Density Peaks-Based Clustering.	Inf.	2021	DBLP DOI BibTeX RDF
13	Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer	From Colourful to Rainbow Paths in Graphs: Colouring the Vertices.	Graphs Comb.	2021	DBLP DOI BibTeX RDF
13	Neil J. Y. Fan, Peter L. Guo	Vertices of Schubitopes.	J. Comb. Theory, Ser. A	2021	DBLP DOI BibTeX RDF
13	Alexandr V. Kostochka, Douglas B. West	On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices.	IEEE Trans. Inf. Theory	2021	DBLP DOI BibTeX RDF
13	Charis Papadopoulos, Athanasios Zisis	Computing and Listing Avoidable Vertices and Paths.	CoRR	2021	DBLP BibTeX RDF
13	Fan Yin, Carter T. Butts	Highly Scalable Maximum Likelihood and Conjugate Bayesian Inference for ERGMs on Graph Sets with Equivalent Vertices.	CoRR	2021	DBLP BibTeX RDF
13	Naoto Ohsaka	A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph.	CoRR	2021	DBLP BibTeX RDF