198,592 Hits in 4.4 sec

The Mixed Page Number of Graphs [article]

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2021 arXiv   pre-print
In this work we initiate the study of the mixed page number of a graph which corresponds to the minimum number of such sets. First, we study the edge density of graphs with bounded mixed page number.  ...  The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.  ...  Observation 3 . 3 The mixed page number of a graph is upper bounded by the maximum mixed page number of its biconnected components plus one.  ... 
arXiv:2107.04993v1 fatcat:yrirbimjhnb5tfhhmbttjfwylq

Mixed Linear Layouts: Complexity, Heuristics, and Experiments [article]

Philipp de Col, Fabian Klute, Martin Nöllenburg
2019 arXiv   pre-print
A k-page linear graph layout of a graph G = (V,E) draws all vertices along a line ℓ and each edge in one of k disjoint halfplanes called pages, which are bounded by ℓ. We consider two types of pages.  ...  We show NP-completeness results on the recognition problem of certain mixed linear layouts and present a new heuristic for minimizing conflicts.  ...  If a page P is a stack page, then no two edges in P may cross, or at least the number of crossings should be minimized.  ... 
arXiv:1908.08938v1 fatcat:4lbclxc3mvgb7a6esfeqw4fvie

One-Page Book Embedding under Vertex-Neighborhood Constraints

Shlomo Moran, Yaron Wolfstahl
1990 SIAM Journal on Discrete Mathematics  
Given a graph G , the boo/.: ~~ dill, problem is Ihal of finding a book embedding of G with the minimum possible number of pages.  ...  In devising an-embedding, one seeks to minimi;ze the number of pages used.  ...  Of particular interest are the possible trade-offs between width and number or pages in b/w embeddings.  ... 
doi:10.1137/0403034 fatcat:ovlrnralcbeszcmiglvaxfh5yq

Distributed Computation of Mixing Time [article]

Anisur Rahaman Molla, Gopal Pandurangan
2016 arXiv   pre-print
We present an efficient distributed algorithm for computing the mixing time of undirected graphs.  ...  The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient  ...  We remark that we can compute the mixing time of a graph in O(m) time in the CONGEST model, where m is the number of edges in the graph.  ... 
arXiv:1610.05646v1 fatcat:gq2sgl36djbaxctkb7phhupspi

Transductive Classification Methods for Mixed Graphs [article]

Sundararajan Sellamanickam, Sathiya Keerthi Selvaraj
2012 arXiv   pre-print
We extend the IR and WvRN methods to deal with mixed graphs.  ...  Most of the existing methods, e.g., Information Regularization (IR), Weighted vote Relational Neighbor classifier (WvRN) etc, assume that the given graph is only a similar graph.  ...  ACKNOWLEDGMENTS The authors are thankful to the anonymous reviewers for their helpful comments.  ... 
arXiv:1206.6015v1 fatcat:bgzna2nzdvdvfcj3wrkpsc24xy

Book announcements

1991 Discrete Applied Mathematics  
Lovasz, An Algorithmic Theory of Numbers, Graphs and Convexity (SIAM, Philadelphia, PA, 1989) 91 pages Chapter 11 : 11 Group Theory in Integer Programming. Introduction.  ...  Watkins, GRAPHS, An Introductory Approach (Wiley, New York, 1990) 333 pages Chap/u I: What is a Graph? Introduction. The definition of a graph. The degree of a vertex. Isomorphic graphs.  ... 
doi:10.1016/0166-218x(91)90034-t fatcat:alt7e3uayfdxncpp7upicindka

Google based name search: Resolving mixed entities on the web

Byung-Won On, Ingyu Lee
2009 2009 Fourth International Conference on Digital Information Management  
In particular, since the correct number of clusters is often unknown, we study a state-of-the-art unsupervised clustering solution based on propagation of pairwise similarities of entities.  ...  ., Oracle) in Google, there exist a mixture of web pages due to the name homonyms (e.g., Oracle Database, Oracle Audio, Oracle Academy, etc.).  ...  Number of Clusters Based on our similarity scheme, top-k web pages can be represented as Graph G, where the p-th web page denotes Node e p , and the edge weight between nodes e p and e q is the TF/IDF  ... 
doi:10.1109/icdim.2009.5356763 dblp:conf/icdim/OnL09 fatcat:62s2p4e7ebelpbzvjknnl5l3li

Scalable clustering methods for the name disambiguation problem

Byung-Won On, Ingyu Lee, Dongwon Lee
2011 Knowledge and Information Systems  
In this paper, in particular, we study the scalability issue of the name disambiguation problem -when (1) a small number of entities with large contents or (2) a large number of entities get un-distinguishable  ...  Then, we propose two scalable graph partitioning algorithms known as multi-level graph partitioning and multi-level graph partitioning and merging to solve the large-scale name disambiguation problem.  ...  That is, the 92 web pages, which should truly be categorized into 37 groups of web pages, are mixed since they all have the same name description of "Tom Mitchell".  ... 
doi:10.1007/s10115-011-0397-1 fatcat:zora6tw6ovc4vodgssykd7kurq

Page 44 of Electronic Publishing Vol. 6, Issue 4 [page]

1993 Electronic Publishing  
Different non- text elements (figures, formulas, and tables) are mixed in these pages, which increases the ambiguity.  ...  Figure 6 shows the layer network view of the first five stages of parsing on the document graph of our example.  ... 

Page 162 of Computer Performance Vol. 5, Issue 3 [page]

1984 Computer Performance  
The graph of the function is shown in Figure 2.  ...  A discrete event simulator was therefore written to find the effect on the number of page faults of steadily reducing the number of page frames available to the program.  ... 

Where to Start Browsing the Web? [chapter]

Dániel Fogaras
2003 Lecture Notes in Computer Science  
Somewhat surprisingly, the Page Rank scores computed on the reversed Web graph turn out to be a special case of our class of rank functions.  ...  Apart from ranking algorithms, the existence of central pages is interesting in its own right, providing a deeper insight to the Small World property of the Web graph. £  ...  Acknowledgment I wish to thank Katalin Friedl, András Benczúr and András Lőrincz for the valuable discussions and for improving the level of this manuscript.  ... 
doi:10.1007/978-3-540-39884-4_6 fatcat:g7qx3wulvzb7zftp6deiyukgvi

Disclosure of Corporate Social Responsibility Practices

Md Morshadul Hasan
2020 Journal of Accounting and Finance in Emerging Economies  
Moreover, although most of the commercial banks have disclosed some quantitative data, the aggregate amount of qualitative and mixed types of CSR disclosure is higher than that of purely quantitative ones  ...  The sample included annual reports for the year 2018 of twenty-eight commercial banks out of thirty commercial banks listed on the Dhaka Stock Exchange (DSE) as of June 30, 2019.  ...  Table 11 measures the utilization of the number of pages to disclose CSR related information of banks.The usages of the page(s) are between 1 to more than 20 pages.  ... 
doi:10.26710/jafee.v5i2.868 fatcat:ql73seqbo5gsfpych7ht2j6baa

Page 105 of Catholic School Journal Vol. 39, Issue 3 [page]

1939 Catholic School Journal  
of practice pages on fractions, mixed fun- damentals and percentages, lessons on drawing and reading line graphs; materials involving the use of formulas and equations in problem solving; and an adequate  ...  Also provides practice and test pages on fractions, ratios, graphs, measures and mixed fundamentals, together with a review section Price $1.50 Arithmetic for the First Half of Grade 8—No. 34-3012 —Consists  ... 

Special issue on advances in nature inspired algorithms for complex numerical optimization problems

Jagdish Chand Bansal, Millie Pant, Kusum Deep, Harish Sharma
2013 Memetic Computing  
Thank you to the numerous referees for their expertise and all the hard work allocated to the reviewing task.  ...  In particular, we thank the Managing Editor-in-Chief, Meng-Hiot Lim and Technical Editors-in-Chief Steven Gustafson, Natalio Krasnogor and Yew Soon Ong for their support and help during the process.  ...  From the experimental results, authors also presented the conjectures for the K-page crossing number of some complete tripartite graphs and page number of toroidal meshes and a class of complete bipartite  ... 
doi:10.1007/s12293-013-0125-3 fatcat:b4cl2ncwq5eijji3agwl32fqii

On Mixed Linear Layouts of Series-Parallel Graphs [article]

Patrizio Angelini and Michael A. Bekos and Philipp Kindermann and Tamara Mchedlidze
2020 arXiv   pre-print
A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same stack cross and no two  ...  In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1-stack 1-queue layout.  ...  A linear layout of graph is defined by a total order of its vertex-set and by a partition of its edge-set into a number of subsets, called pages.  ... 
arXiv:2008.10475v2 fatcat:bcqzavoinnegtl3vk3kzz7whru
« Previous Showing results 1 — 15 out of 198,592 results