Note on property M(k) of some complete multipartite graphs (English)
- New search for: Wang, Y.
- New search for: Zhang, X.
- New search for: Wang, Y.
- New search for: Zhang, X.
In:
INFORMATION PROCESSING LETTERS
;
115
, 2
;
228-231
;
2015
-
ISSN:
- Article (Journal) / Print
-
Title:Note on property M(k) of some complete multipartite graphs
-
Contributors:
-
Published in:INFORMATION PROCESSING LETTERS ; 115, 2 ; 228-231
-
Publisher:
- New search for: Elsevier Science B.V., Amsterdam.
-
Publication date:2015-01-01
-
Size:4 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 004
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 004 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 115, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 75
-
Eliminability of cut in hypersequent calculi for some modal logics of linear framesIndrzejczak, Andrzej et al. | 2014
- 82
-
Detecting monomials with k distinct variablesFloderus, Peter / Lingas, Andrzej / Persson, Mia / Sledneu, Dzmitry et al. | 2014
- 87
-
Completeness of context-sensitive rewritingLucas, Salvador et al. | 2014
- 93
-
A note on envy-free cake cutting with polynomial valuationsBrânzei, Simina et al. | 2014
- 96
-
A fixed-parameter algorithm for the vertex cover Formula Not Shown problemTu, J. et al. | 2015
- 96
-
A fixed-parameter algorithm for the vertex cover problemTu, Jianhua et al. | 2014
- 96
-
A fixed-parameter algorithm for the vertex cover P^sub 3^ problemJianhua Tu et al. | 2015
- 100
-
Improved analysis of -sampling based PTAS for k-means and other clustering problemsJaiswal, Ragesh / Kumar, Mehul / Yadav, Pulkit et al. | 2014
- 100
-
Improved analysis of D^sup 2^-sampling based PTAS for k-means and other clustering problemsRagesh Jaiswal et al. | 2015
- 100
-
Improved analysis of Formula Not Shown -sampling based PTAS for k-means and other clustering problemsJaiswal, R. / Kumar, M. / Yadav, P. et al. | 2015
- 104
-
The hamiltonicity of generalized honeycomb torus networksDong, Qiang / Zhao, Qian / An, Yahui et al. | 2014
- 112
-
Convergence of best-response dynamics in games with conflicting congestion effectsFeldman, Michal / Tamir, Tami et al. | 2014
- 119
-
On the maximum acyclic subgraph problem under disjunctive constraintsMapa, Sílvia Maria Santana / Urrutia, Sebastián et al. | 2014
- 125
-
The termination of the higher-dimensional tarai functionsIshiu, Tetsuya / Kikuchi, Masashi et al. | 2014
- 128
-
An ID-based signcryption scheme with compartmented secret sharing for unsigncryptionEnos, Graham / Zheng, Yuliang et al. | 2014
- 134
-
Circulant graphs and GCD and LCM of subsetsvon zur Gathen, Joachim / Shparlinski, Igor E. et al. | 2014
- 139
-
A note on nonexistence of vectorial bent functions with binomial trace representation in the classPasalic, E. et al. | 2014
- 139
-
A note on nonexistence of vectorial bent functions with binomial trace representation in the Formula Not Shown classPasalic, E. et al. | 2015
- 141
-
On hypercube packings, blocking sets and a covering problemAshik Mathew, K. / Östergård, Patric R.J. et al. | 2014
- 146
-
A case for a fast trip count predictorAlves, Péricles R.O. / Rodrigues, Raphael E. / de Sousa, Rafael Martins / Quintão Pereira, Fernando Magno et al. | 2014
- 151
-
The pessimistic diagnosability of alternating group graphs under the PMC modelTsai, Chang-Hsiung et al. | 2014
- 155
-
Reachability problems for Markov chainsAkshay, S. / Antonopoulos, Timos / Ouaknine, Joël / Worrell, James et al. | 2014
- 159
-
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshopGerstl, Enrique / Mor, Baruch / Mosheiov, Gur et al. | 2014
- 163
-
Minimax regret 1-sink location problem in dynamic cycle networksXu, Yinfeng / Li, Hongmei et al. | 2014
- 170
-
An approximation algorithm for the cutting-sticks problemM, Jagadish et al. | 2014
- 175
-
Using static suffix array in dynamic application: Case of text compression by longest first substitutionRistov, Strahil / Korenčić, Damir et al. | 2014
- 182
-
An LP-rounding Formula Not Shown -approximation for restricted maximum acyclic subgraphGrandoni, F. / Kociumaka, T. / Włodarczyk, M. et al. | 2015
- 182
-
An LP-rounding (...)-approximation for restricted maximum acyclic subgraphFabrizio Grandoni et al. | 2015
- 182
-
An LP-rounding -approximation for restricted maximum acyclic subgraphGrandoni, Fabrizio / Kociumaka, Tomasz / Włodarczyk, Michał et al. | 2014
- 186
-
Greedily computing associative aggregations on sliding windowsBasin, David / Klaedtke, Felix / Zălinescu, Eugen et al. | 2014
- 193
-
Arbitrary sequence RAMsBrand, Michael et al. | 2014
- 199
-
Topological additive numbering of directed acyclic graphsMarenco, Javier / Mydlarz, Marcelo / Severín, Daniel et al. | 2014
- 203
-
Routing and wavelength assignment for exchanged hypercubes in linear array optical networksLiu, Yu-Liang et al. | 2014
- 209
-
On the decycling number of generalized Kautz digraphsLien, Min-Yun / Kuo, Jyhmin / Fu, Hung-Lin et al. | 2014
- 212
-
A ground-complete axiomatization of stateless bisimilarity over LindaAceto, Luca / Goriac, Eugen-Ioan / Ingolfsdottir, Anna et al. | 2014
- 221
-
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphsNing, Bo et al. | 2014
- 225
-
A sufficient condition involving implicit degree and neighborhood intersection for long cyclesCai, Junqing et al. | 2014
- 228
-
Note on property M(k) of some complete multipartite graphsWang, Yanning / Wang, Yanyan / Zhang, Xuguang et al. | 2014
- 232
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbonesJanczewski, Robert / Turowski, Krzysztof et al. | 2014
- 237
-
Dynamic pricing of call rates: Bayesian approachDugar, Chetan / Jain, Anuj / Rajawat, Amit / Bhattacharya, Swapan et al. | 2014
- 243
-
A simple algorithm for computing positively weighted straight skeletons of monotone polygonsBiedl, Therese / Held, Martin / Huber, Stefan / Kaaser, Dominik / Palfrader, Peter et al. | 2014
- 248
-
Credibility decay model in temporal evidence combinationSong, Yafei / Wang, Xiaodan / Lei, Lei / Xing, Yaqiong et al. | 2014
- 253
-
A note: Minimizing maximum earliness on a proportionate flowshopMor, Baruch / Mosheiov, Gur et al. | 2014
- 256
-
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphsBrandstädt, Andreas / Fičur, Pavel / Leitert, Arne / Milanič, Martin et al. | 2014
- 263
-
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Formula Not Shown , or 11Chen, X. e. / Li, Z. et al. | 2015
- 263
-
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with , or 11Chen, Xiang'en / Li, Zepeng et al. | 2014
- 263
-
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with [delta] = 9, 10, or 11Xiang'en Chen et al. | 2015
- 269
-
A new lower bound for the number of perfect matchings of line graphZhou, Xue et al. | 2014
- 275
-
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodesWatel, Dimitri / Weisser, Marc-Antoine / Bentz, Cédric / Barth, Dominique et al. | 2014
- 280
-
An enumeration algorithm for all integers nonrepresentable by some positive integersMatsubara, Shunichi et al. | 2014
- 285
-
3D depth information extraction with omni-directional cameraJia, Tong / Shi, Yan / Zhou, ZhongXuan / Chen, DongYue et al. | 2014
- 292
-
Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded softwareAgosta, Giovanni / Barenghi, Alessandro / Pelosi, Gerardo / Scandale, Michele et al. | 2014
- 298
-
Topological sorts on DAGsPang, Chaoyi / Wang, Junhu / Cheng, Yu / Zhang, Haolan / Li, Tongliang et al. | 2014
- 302
-
A note on local coloring of graphsLi, Zepeng / Shao, Zehui / Zhu, Enqiang / Xu, Jin et al. | 2014
- 306
-
Comments on the hierarchically structured bin packing problemLambert, Thomas / Marchal, Loris / Uçar, Bora et al. | 2014
- 310
-
Computing the pathwidth of directed graphs with small vertex coverKobayashi, Yasuaki et al. | 2014
- 313
-
Approximation algorithms for the arc orienteering problemGavalas, Damianos / Konstantopoulos, Charalampos / Mastakas, Konstantinos / Pantziou, Grammati / Vathis, Nikolaos et al. | 2014
- 316
-
The complexity of the zero-sum 3-flowsDehghan, Ali / Sadeghi, Mohammad-Reza et al. | 2014
- 321
-
On packing arborescences in temporal networksKamiyama, Naoyuki / Kawase, Yasushi et al. | 2014
- 326
-
The strong chromatic index of sparse graphsDębski, Michał / Grytczuk, Jarosław / Śleszyńska-Nowak, Małgorzata et al. | 2014
- 331
-
The clique-transversal set problem in claw-free graphs with degree at most 4Liang, Zuosong / Shan, Erfang et al. | 2014
- 336
-
A unified scheme for generalizing cardinality estimators to sum aggregationCohen, Reuven / Katzir, Liran / Yehezkel, Aviv et al. | 2014
- 343
-
A comment on “The domination number of exchanged hypercubes”Jha, Pranava K. et al. | 2014
- 345
-
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphsBrandstädt, Andreas / Giakoumakis, Vassilis et al. | 2014
- 351
-
An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problemMeshram, Chandrashekhar et al. | 2014
- 359
-
AKF: A key alternating Feistel scheme for lightweight cipher designsKarakoç, F. / Demirci, H. / Harmancı, A.E. et al. | 2014
- 368
-
k-Attribute-Anonymity is hard even forScott, Allan / Srinivasan, Venkatesh / Stege, Ulrike et al. | 2014
- 368
-
k-Attribute-Anonymity is hard even for Formula Not ShownScott, A. / Srinivasan, V. / Stege, U. et al. | 2015
- 371
-
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphsLin, Min-Sheng / Ting, Chao-Chun et al. | 2014
- 377
-
On finding the longest antisymmetric path in directed acyclic graphsSong, Yinglei / Yu, Menghong et al. | 2014
- 382
-
Affine-evasive sets modulo a primeAggarwal, Divesh et al. | 2014
- 386
-
An improved preimage attack against HAVAL-3Guo, Jian / Su, Chunhua / Yap, Wun-She et al. | 2014
- 394
-
The connectivity of exchanged crossed cubeNing, Wantao / Feng, Xiaoli / Wang, Ling et al. | 2014
- 397
-
A fast algorithm for order-preserving pattern matchingCho, Sukhyeun / Na, Joong Chae / Park, Kunsoo / Sim, Jeong Seop et al. | 2014
- IFC
-
Editorial Board| 2014