{"entities":{"Q1920227":{"pageid":1930969,"ns":120,"title":"Item:Q1920227","lastrevid":43422535,"modified":"2025-07-25T16:51:13Z","type":"item","id":"Q1920227","labels":{"en":{"language":"en","value":"Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 918712"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1920227$12137BB8-466B-41FF-B0DC-6CD018A9E539","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"608013058d3853054f4fa3b995d0d372049982eb","datavalue":{"value":{"text":"Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1920227$2840FEF7-8BC9-4E91-A971-013DB2481189","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3e73174c1750e92eb403885951c92f0cb29ef994","datavalue":{"value":"0865.68086","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1920227$4CE16A18-FED5-4756-94A5-D62E0F72B3CA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba81531d441e099b67c5a341d26c2b25e00d7f91","datavalue":{"value":{"entity-type":"item","numeric-id":1209982,"id":"Q1209982"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1920227$D62565EB-8AB4-4214-925D-4AC49003D87B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5c35f5d32066d6b95640cdff3f46c055355e3670","datavalue":{"value":{"entity-type":"item","numeric-id":233432,"id":"Q233432"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1920227$F1949EFC-E671-4956-B687-85292A4270DF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d0f02e85530cd06ceb2c58a40dc9c2e0258e194","datavalue":{"value":{"entity-type":"item","numeric-id":161641,"id":"Q161641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1920227$18B5370A-1B67-4335-A329-F9AB558CB010","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"54b100d45144c27be85321cfe135c80bfa60c77e","datavalue":{"value":{"time":"+1997-06-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1920227$A168575A-921B-4FD4-BD69-A8F84371B769","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7a151c4c8a659e29675225a2a23596c5eb15341b","datavalue":{"value":"Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and complex bipartite graphs are presented.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1920227$917B43FD-159C-4441-9176-2DBEC0E6AC6E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1920227$B8BED99F-0C1F-4591-B5DB-A8D42DF3394A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1920227$6664F548-D0F7-4352-AE85-FCEEDEEBFF97","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3849c3e4b36eea9ff7fae67a5f42241674404147","datavalue":{"value":"918712","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1920227$FA3BDE23-D1C0-499D-951B-A4524C71B973","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1a92166f5adeebffc8c81c6abb980ed495030be8","datavalue":{"value":"polynomial-time algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1920227$C1219845-E049-48AD-B1E9-4B353AB6318A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c52f7b4a553b1787b81b760bd70e732f8e5abf8","datavalue":{"value":"feedback vertex set","type":"string"},"datatype":"string"},"type":"statement","id":"Q1920227$EFEC04D9-1A63-4F98-A371-4C8E0E873143","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cbfeffd12b664e76aec2f0d8ca9ba37ca2617ebb","datavalue":{"value":"cocomparability graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1920227$006C3953-49F1-4657-888F-808414E09829","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6aa4120af19b14ed3e364de806633602c889efd8","datavalue":{"value":"complex bipartite graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1920227$2DBBC4DD-5887-4594-825E-127B7A0CF810","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1920227$C757A021-A287-4891-BBA6-8DA1071DD5C3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1920227","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1920227"}}}}}